Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs

European Journal of Operational Research

Volumn 113, Issue 2, 1999, Pages 450-468

  Soroush, H M ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Due date; Production; Sequencing; Single machine; Stochastic

Indexed keywords

COMPUTATIONAL METHODS; COSTS; CRITICAL PATH ANALYSIS; DECISION THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PERT; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING;

DUE-DATE DETERMINATIONS;

PRODUCTION CONTROL;

EID: 0033102034     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0377-2217(98)00003-4     Document Type: Article

References (37)

1. Baker, K.R., 1974. Introduction to Sequencing and Scheduling. Wiley, New York.
2. Baker K.R., Bertrand J.W.M. A comparison of due-date selection rules. AIIE Transactions. 13(2):1981;123-131.
3. Baker K.R., Scudder G.D. On the assignment of optimal due-dates. Journal of Operational Research Society. 40:1989;93-95.
4. Baker K.R., Scudder G.D. Sequencing with earliness and tardiness penalties: A review. Operations Research. 38:1990;22-36.
5. Balut S.J. Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Science. 19:1973;1283-1288.
6. Bertrand J.W.M. The use of workload information to control job lateness in controlled and uncontrolled release production systems. Journal of Operations Management. 3:1983;79-92.
7. Cheng T.C.E. Optimal due-date determination and sequencing of n jobs on a single machine. Journal of the Operational Research Society. 35:1984;433-437.
8. Cheng T.C.E. Analytical determination of optimal TWK due-date in a job shop. International Journal of Systems Science. 16:1985;777-787.
9. Cheng T.C.E. Optimal due-date assignment for a single machine sequencing problem with random processing times. International Journal of Systems Science. 17:1986;1039-1144.
10. Cheng T.C.E. An algorithm for the CON due-date determination and sequencing problem. Computers and Operations Research. 14:1987;537-542.
11. Cheng T.C.E. Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine. European Journal of Operational Research. 51:1991;348-353.
12. Cheng T.C.E., Gupta M.C. Survey of scheduling research involving due-date determination decisions. European Journal of Operational Research. 38:1989;156-166.
13. Conway R.W. Priority dispatching and job lateness in a job shop. Journal of Industrial Engineering. 16:1965;228-237.
14. Conway, R.W., Maxwell, W.L., Miller, L.W., 1967. Theory of Scheduling. Addison-Wesley, Reading, MA.
15. Eilon S., Chowdhury I.G. Minimizing waiting time variance in the single machine problem. Management Science. 23:1977;567-575.
16. Elvers D.A. Job shop dispatching rules using various delivery date setting criteria. Production and Inventory Management. 14:1973;62-70.
17. Fawcett S.E., Pearson J.N. Understanding and applying constraint management in today's manufacturing environments. Production and Inventory Management Journal. 32:1991;46-55.
18. Horowitz, E., Sahni, S., 1983. Fundamentals of Data Structures. Computer Science Press, Rockville, MD.
19. Jones C.H. A economic evaluation of job shop dispatching rules. Management Science. 20:1987;293-303.
20. Kanet J.J. Minimizing the average deviation of job completion times about a common due-date. Naval Research Logistics Quarterly. 28:1981;643-651.
21. Kanet, J.J., Christy, D.P., 1984. Manufacturing systems with forbidden early order departure. International Journal of Production Research 22, 44-50.
22. Karmarkar U.S. Lot sizes, lead times and in-process inventories. Management Science. 33:1987;409-418.
23. Kise H., Ibaraki T. On Balut's algorithm and NP-completeness for a chance-constrained scheduling problem. Management Science. 29:1983;384-388.
24. McKay K.N., Safayeni F.R., Buzacott J.A. Job-shop scheduling theory: What is relevant? Interfaces. 18:1988;84-90.
25. Panwalkar S., Smith M., Seidmann A. Common due-date assignment to minimize total penalty for the one machine scheduling problem. Operations Research. 30:1982;391-399.
26. Ragatz G.L., Mabert V.A. A framework for the study of due-date management in job shops. International Journal of Production Research. 22:1984;685-695.
27. Sarin S.C., Erel E., Steiner G. Sequencing jobs on a single machine with a common due-date and stochastic processing times. European Journal of Operational Research. 51:1991;188-198.
28. Seidmann A., Panwalkar S.S., Smith M.L. Optimal assignment od due-dates for a single processor scheduling problem. International Journal of Production Research. 14:1981;43-70.
29. Sen T., Gupta S.K. A state-of-art survey of static scheduling research involving due-dates. OMEGA. 12(1):1984;63-74.
30. Sidney J.B. Single machine scheduling with earliness and tardiness penalties. Operations Research. 25:1977;62-69.
31. Smith, M.L., Dudek, R.A., Blair, E.L., 1986. Characteristics of US flexible manufacturing system - A survey. In: Stecke K.E., Suri R., (Eds.), Flexible Manufacturing Systems. Elsevier, Amsterdam.
32. Smith M.L., Seidmann A. Due-date selection procedures for job shop simulation. Computers and Industrial Engineering. 7:1983;199-207.
33. Soroush H.M., Fredendall L.D. The stochastic single machine scheduling problem with earliness and tardiness costs. European Journal of Operational Research. 77:1994;287-302.
34. Taylor S.G., Bolander S.F. Process flow scheduling principles. Production and Inventory Management Journal. 32:1991;67-71.
35. Umble, M.M., Srikanth, M.L., 1990. Synchronous Manufacturing. South-Western Publishing, Cincinnati, OH.
36. Week J.K., Fryer J.S. A simulation study of operating policies in a hypothetical dual-constrained job shop. Management Science. 22:1976;1362-1371.
37. White, D.J., 1969. Dynamic Programming. Holden-Day, San Francisco, CA.