zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Survey of scheduling research involving due date determination decisions. (English) Zbl 0658.90049
We attempt to present a critical review of a particular segment of scheduling research in which the due date assignment decision is of primary interest. The literature is classified into the static and dynamic job shop situations. The static job shop is analyzed from two different perspectives: the due date is constrained to be greater than or equal to makespan, and the optimal due date and optimal sequence are to be determined when the method of assigning due dates is specified. The literature on dynamic job shops is also reviewed under two broad categories. First, we discuss all the literature concerned with comparative and investigative studies to identify the most desirable due date assignment method. Second, we discuss the literature dealing with determination of optimal due dates. We note that computer simulation and analytical methods are two common approaches for the second type of problems. We observe that while the static single-machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods. Finally, we identify and suggest some worthwhile areas for future research.

MSC:
90B35Scheduling theory, deterministic
90-02Research monographs (optimization)
WorldCat.org
Full Text: DOI
References:
[1] Ahmed, M.U.; Sundararaghavan, P.S.: Minimizing the sum of absolute deviation of completion times from their due-dates in a single machine scheduling problem. TIMS southeast chapter meeting, 38-40 (1984)
[2] Ashour, S.; Vaswani, S.D.: A GASP simulation study of job shop scheduling. Simulation 18, 1-13 (1972)
[3] Bagchi, U.; Sullivan, R.S.; Chang, Y.L.: Minimizing mean absolute deviation of completion times about a common due-date. Naval research logistics 33, 227-240 (1986) · Zbl 0599.90049
[4] Bagchi, U.; Sullivan, R.S.; Chang, Y.L.: Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties about a common due-date. Naval research logistics 34, 739-751 (1987) · Zbl 0657.90052
[5] Bagchi, U.; Sullivan, R.S.; Chang, Y.L.: Minimizing mean squared deviation of completion times about a common due-date. Management science 33, 899-906 (1987) · Zbl 0636.90049
[6] Baker, K.R.: Sequencing rules and due-date assignment in a job shop. Management science 30, 1093-1104 (1984)
[7] Baker, K.R.; Bertrand, J.W.M.: A comparison of due-date selection rules. IIE transaction 13, 123-131 (1981)
[8] Baker, K.R.; Bertrand, J.W.M.: An investigation of due date assignment rules with constrained tightness. Journal of operations management 1, 109-121 (1981)
[9] Baker, K.R.; Bertrand, J.W.M.: A dynamical priority rules for scheduling against due-dates. Journal of operations management 3, 37-42 (1982)
[10] Bector, C.R.; Gupta, Y.P.; Gupta, M.C.: Optimal sequence of jobs about a common due-date on a single machine. ASAC Proceedings 8, 88-96 (1987) · Zbl 0674.90046
[11] Bector, C.R.; Gupta, Y.P.; Gupta, M.C.: Determination of an optimal common due-date and optimal sequence in a single machine job shop. International journal of production research (1988) · Zbl 0644.90047
[12] Bertrand, J.W.M.: The effect of workload dependent due-dates on job shop performance. Management science 29, 799-816 (1983)
[13] Blackstone, J.H. Jr. , Phillips, D.T.; Hogg, G.L.: A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International journal of production research 20, 27-45 (1982)
[14] Cheng, T.C.E.: A combined approach to due-date scheduling. Advances in production management systems, 363-375 (1982)
[15] Cheng, T.C.E.: Optimal due-date determination in a job shop: an analytical approach. Annual industrial engineering conference Proceedings, 614-626 (1983)
[16] Cheng, T.C.E.: Optimal due-date determination and scheduling in a job shop. Proceedings of 7th international conference on production research, 346-352 (1983)
[17] Cheng, T.C.E.: Optimal due-date determination and sequencing of n jobs on a single machine. Journal of the operational research society 35, 433-437 (1984) · Zbl 0532.90049
[18] Cheng, T.C.E.: A duality approach to due-date determination. Engineering optimization 9, 127-130 (1985)
[19] Cheng, T.C.E.: Analytical determination of optimal TWK due-dates in a job shop. International journal of systems science 16, 777-787 (1985) · Zbl 0575.90031
[20] Cheng, T.C.E.: A note on preemptive due-date scheduling with minimum makespan. International journal on policy and information 9, 137-139 (1985)
[21] Cheng, T.C.E.: A note on the common due-date assignment problem. Journal of the operational research society 37, 1089-1091 (1986) · Zbl 0613.90047
[22] Cheng, T.C.E.: Due-date determination for a single machine shop with SPT dispatching. Engineering costs and production economics 10, 35-41 (1986)
[23] Cheng, T.C.E.: Optimal due-date assignment for a single machines sequencing problem with random processing times. International journal of systems science 17, 1139-1144 (1986) · Zbl 0601.90074
[24] Cheng, T.C.E.: Optimal due-date assignment in a job shop. International journal of production research 24, 503-515 (1986) · Zbl 0585.90048
[25] Cheng, T.C.E.: Optimal slack due-date determination and sequencing. Engineering costs and production economics 10, 305-309 (1986)
[26] Cheng, T.C.E.: On optimal common due-date determination. IMA journal of mathematics in management 1, 39-43 (1986) · Zbl 0622.90048
[27] Cheng, T.C.E.: Minimizing the average deviation of job completion times about a common due-date: an extension. Mathematical modelling 9, 13-15 (1987) · Zbl 0631.90033
[28] Cheng, T.C.E.: Minimizing the maximum deviation of job completion times about a common due-date. Computers and mathematics with applications 14, 279-283 (1987) · Zbl 0636.90045
[29] Cheng, T.C.E.: Optimal due-date determination and sequencing with random processing times. Mathematical modelling 9, 573-576 (1987) · Zbl 0638.90053
[30] Cheng, T.C.E.: An algorithm for the CON due-date determination and sequencing problem. Computers and operations research 14, 537-542 (1987) · Zbl 0634.90030
[31] Cheng, T.C.E.: Optimal total-work-content-power due-date determination and sequencing. Computers and mathematics with applications (1988)
[32] Cheng, T.C.E.: Optimal constant due-date assignment and sequencing. International journal of systems science (1988) · Zbl 0645.90039
[33] Cheng, T.C.E.: Optimal common due-date with limited completion time deviation. Computers and operations research (1988) · Zbl 0635.90050
[34] Cheng, T.C.E.: Integration of priority dispatching and due-date assignment in a job shop. International journal of systems science (1988) · Zbl 0653.90033
[35] Cheng, T.C.E.: An alternative proof of optimality for the common due-date assignment problem. European journal of operational research (1988) · Zbl 0652.90059
[36] Conway, R.W.: Priority dispatching and job lateness in a job shop. Journal of industrial engineering 16, 228-237 (1965)
[37] Eilon, S.: Production scheduling. Or ’78, 237-266 (1978)
[38] Eilon, S.; Chowdhury, I.G.: Due-date in job scheduling. International journal of production research 14, 223-238 (1976)
[39] Eilon, S.; Chowdhury, I.G.: Minimizing waiting time variance in the single machine problem. Management science 23, 567-575 (1977) · Zbl 0362.90051
[40] Eilon, S.; Hodgson, R.M.: Job shop scheduling with due-dates. International journal of production research 6, 1-13 (1967)
[41] Elvers, D.A.: Job shop dispatching rules using various delivery date setting criteria. Production and inventory management 14, 62-70 (1973)
[42] French, S.: Sequencing and scheduling. (1983) · Zbl 0561.90053
[43] Gupta, S.K.; Kyparisis, J.: Single machine scheduling research. Omega 15, 207-227 (1987)
[44] Hall, N.G.: Single and multiple processor models for minimizing completion time variance. Naval research logistics 33, 49-54 (1986) · Zbl 0599.90057
[45] Heard, E.L.: A dynamic programming approach to setting due-dates in a closed job shop. (1970)
[46] Jones, C.H.: An economic evaluation of job shop dispatching rules. Management science 20, 293-303 (1973)
[47] Kalra, K.R.; Bagga, P.C.: Some remarks on the paper ”minimizing the average deviation of job completion times about a common due-date” by kanet. Proceedings of operational society of India, 2-7 (1983) · Zbl 0605.90069
[48] Kanet, J.J.: Minimizing the average deviation of job completion times about a common due-date. Naval research logistics quarterly 28, 643-651 (1981) · Zbl 0548.90037
[49] Kanet, J.J.: On anomalies in dynamic ratio type scheduling rules: A clarifying analysis. Management science 28, 1337-1341 (1982) · Zbl 0503.90052
[50] Karmarker, U.S.: Lot sizes, lead times and in-process inventories. Management science 33, 409-418 (1987) · Zbl 0612.90068
[51] Miyazaki, S.: Combined scheduling system for reducing job tardiness in a job shop. International journal of production research 19, 201-211 (1981)
[52] Panwalker, S.S.; Iskander, W.: A survey of scheduling rules. Operations research 25, 45-61 (1977) · Zbl 0369.90054
[53] Panwalker, S.S.; Smith, M.L.; Seidmann, A.: Common due-date assignment to minimize total penalty for the one machine scheduling problem. Operations research 30, 391-399 (1982) · Zbl 0481.90042
[54] Quaddus, M.A.: On the duality approach to optimal due-date determination and sequencing in a job shop. Engineering optimization 10, 271-278 (1987)
[55] Quaddus, M.A.: A generalized model of optimal due-date assignment to minimize total penalty for the one machine scheduling problem. Journal of the operational research society 38, 353-359 (1987) · Zbl 0608.90045
[56] Ragatz, G.L.; Mabert, V.A.: A framework for the study of due-date management in job shops. International journal of production research 22, 685-695 (1984)
[57] Ragatz, G.L.; Mabert, V.A.: A simulation analysis of due-date assignment rules. Journal of operations management 5, 27-39 (1985)
[58] Raghavachari, M.: A V-shape property of optimal schedule of jobs about a common due-date. European journal of operational research 23, 401-402 (1986) · Zbl 0584.90043
[59] Reinitz, R.C.: On the scheduling problem. Industrial scheduling (1963)
[60] Seidmann, A.; Smith, M.L.: Due-date assignment for production systems. Management science 27, 571-581 (1981) · Zbl 0456.90038
[61] Seidmann, A.; Panwalker, S.S.; Smith, M.L.: Optimal assignment of due-dates for a single processor scheduling problem. International journal of production research 19, 393-399 (1981)
[62] Sen, T.; Austin, L.M.; Ghandforosh, P.: An algorithm for the single-machine sequencing problem to minimize total tardiness. IIE transactions 15, 363-366 (1983)
[63] Sen, T.; Gupta, S.K.: A state-of-art survey of static scheduling research involving due-dates. Omega 12, 63-76 (1984)
[64] Smith, M.L.; Dudek, R.A.; Blair, E.L.: Characteristics of US flexible manufacturing system--A survey. Flexible manufacturing systems (1986)
[65] Smith, M.L.; Seidmann, A.: Due-date selection procedures for job shop simulation. Computers and industrial engineering 7, 199-207 (1983)
[66] Sundararaghavan, P.S.; Ahmed, M.U.: Minimizing the sum of absolute lateness in single machine and multi machine scheduling. Naval research logistics quarterly 31, 325-333 (1984) · Zbl 0544.90052
[67] Weeks, J.K.: A simulation study of predictable due-dates. Management science 25, 363-373 (1979) · Zbl 0409.90041
[68] Weeks, J.K.; Fryer, J.S.: A simulation study of operating policies in a hypothetical dual-constrained job shop. Management science 22, 1362-1371 (1976) · Zbl 0328.90040