Job sequencing and due date assignment in a single machine shop with uncertain processing times

European Journal of Operational Research

Volumn 184, Issue 1, 2008, Pages 63-75

  Xia, Yu ^a   Chen, Bintong ^b   Yue, Jinfeng ^a  

^a MIDDLE TENNESSEE STATE UNIVERSITY   (United States)

^b WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Distribution free decision; Due date assignment; Heuristics; Scheduling; Sequencing

Indexed keywords

HEURISTIC ALGORITHMS; NUMERICAL ANALYSIS; PRODUCTION CONTROL; UNCERTAIN SYSTEMS;

DISTRIBUTION-FREE DECISION; DUE DATE ASSIGNMENT; JOB TARDINESS;

SCHEDULING;

EID: 34548434627     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.10.058     Document Type: Article

References (25)

1. Al-Turki U.M., Mittenthal J., and Raghavachari M. The single-machine absolute-deviation early-tardy problem with random completion times. Naval Research Logistics 43 (1996) 573-587
2. Bagchi U., Chang Y., and Sullivan R. Minimizing mean absolute deviation of completion times about a common due date. Naval Research Logistics 33 (1986) 227-240
3. Bagchi U., Chang Y., and Sullivan R. Minimize absolute and squared deviation of completion times with different earliness and tardiness penalties and a common due date. Naval Research Logistics 34 (1987) 739-751
4. Baker K.R., and Scudder G.D. On the assignment of optimal due dates. Journal of Operational Research Society 40 (1989) 93-95
5. Baker K.R., and Scudder G.D. Sequencing with earliness and tardiness penalties: A review. Operations Research 38 (1990) 22-36
6. Cai X., and Tu F.S. Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties. Naval Research Logistics 43 (1996) 1127-1146
7. Cheng T.C.E. Optimal due-date assignment for a single machine sequencing problem with random processing times. International Journal of System Science 17 (1986) 1139-1144
8. Cheng T.C.E. An algorithm for the con due date determination and sequencing problem. Computers and Operations Research 14 (1987) 537-542
9. 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
10. Cheng T.C.E., and Gupta M.C. Survey of scheduling research involving due date determination decisions. European Journal of Operational Research 38 (1989) 156-166
11. Gallego G., and Moon I. The distribution free newsboy problem: Review and extensions. Journal of Operational Research Society 44 (1993) 825-834
12. Gordon V., and Strusevich V.A. Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research 26 (1999) 157-177
13. Hall N. Single and multi-processor models for minimizing completion time variance. Naval Research Logistics 33 (1986) 49-54
14. Hall N. Scheduling problems with generalized due dates. IIE Transactions 18 (1986) 220-222
15. Kanet J. Minimizing variation of flow time in single machine systems. Management Science 27 (1981) 1453-1459
16. Ow P., and Morton T. The single machine early-tardy problem. Management Science 35 (1989) 177-191
17. Qi X.D., Yin G., and Birge J.R. Scheduling problems with random processing times under expected earliness/tardiness costs. Stochastic Analysis and Applications 18 (2000) 453-473
18. Qi X.D., Yin G., and Birge J.R. Single-machine scheduling with random machine breakdowns and randomly compressible processing times. Stochastic Analysis and Applications 18 (2000) 635-653
19. Qi X.D., Yu G., and Bard J.F. Single machine scheduling with assignable due dates. Discrete Applied Mathematics 122 (2002) 211-233
20. Raghavachari M. Scheduling problems with non-regular penalty functions- a review. Operations Research 25 (1988) 144-164
21. Scarf H. A min-max solution of an inventory problem. In: Arrow K., Karlin S., and Scarf H. (Eds). Studies in the Mathematical Theory of Inventory and Production (1958), Stanford University Press, California 201-209
22. Seidmann A., Panwalker S.S., and Smith M.L. Optimal assignment of due-dates for a single processor scheduling problem. International Journal of Production Research 19 (1981) 393-399
23. Szwarc W. Single machine scheduling to minimize absolute deviation of completion times from a common due date. Naval Research logistics 36 (1989) 663-673
24. Yue, J., 2000. Distribution free optimization procedures with business application. PhD Dissertation, Washington State University.
25. Yue, J., Chen,B., Wang, M.C., 2006. Expected value of distribution information for newsvendor problem. Operations Research 54 (6), in press.