Stochastic scheduling to minimize expected maximum lateness

European Journal of Operational Research

Volumn 190, Issue 1, 2008, Pages 103-115

  Wu, Xianyi ^a   Zhou, Xian ^b  

^a EAST CHINA NORMAL UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Due dates; Dynamic programming algorithms; Expected maximum lateness; Stochastic scheduling

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; OPTIMAL SYSTEMS; PROBABILITY DISTRIBUTIONS; SCHEDULING;

DUE DATES; EXPECTED MAXIMUM LATENESS; PROCESSING TIMES; STOCHASTIC SCHEDULING;

STOCHASTIC CONTROL SYSTEMS;

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

References (17)

1. Cai X., and Zhou X. Single-machine scheduling with exponential processing times and general stochastic cost functions. Journal of Global Optimization 31 (2005) 317-332
2. Cai, X., Wang, L., Zhou, X., in press. Minimization of maximum weighted lateness under stochastic order. The Journal of Scheduling.
3. Chanas S., and Adam Kasperski A. Minimizing maximum lateness on a single machine scheduling problem with fuzzy processing times and fuzzy due dates. Engineering Applications of Artificial Intelligence 14 (2001) 377-386
4. Cochand M., de Werra D., and Slowinski R. Preemptive scheduling with staircase and piecewise linear resource availability. Zeitschrift fuer Operations Research 33 (1989) 297-313
5. Frederickson G.N. Scheduling unit time tasks with integer release times and deadlines. Information Processing Letters 16 (1983) 171-173
6. Horn W.A. Some Simple Scheduling Algorithms. Naval Research Logistics Quarterly 21 (1974) 177-185
7. Jackson, J.R., 1955. Scheduling a production like to minimize maximum tardiness. Technical Report 43, University of California, Los Angeles.
8. Kellerer H. In: Leung J. (Ed). Minimizing the maximum lateness, A Chapter in Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), Chapman & Hall/CRC
9. Lawler E.L. Optimal sequencing of a single machine subject to precedence constraints. Management Science 19 (1973) 544-546
10. Lawler E.L., and Labetoulle J. On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming. Journal of the Association for Computing Machinery 25 (1978) 612-619
11. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Operations Research 1 (1977) 342-362
12. Pinedo M. Scheduling: Theory, Algorithms, and Systems. second ed. (2002), Prentice Hall, Englewood Cliffs
13. Sahni S. Preemptive scheduling with due dates. Operations Research 27 (1979) 925-934
14. Slowinski R. Scheduling preemptable tasks on unrelated processors with additional resources to minimize schedule length. In: Bracchi G., and Lockermann P.C. (Eds). Information Systems Methodology. Lecture Notes in Computer Science. 65 (1978), Springer-Verlag, Berlin 536-547
15. Slowinski R. Two approaches to problems of resource allocation among project activities - a comparative study. Journal of the Operational Research Society 31 (1980) 711-723
16. Slowinski R. Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. European Journal of Operational Research 15 (1984) 366-373
17. Zhou X., and Cai X. General stochastic single-machine scheduling with regular cost functions. Mathematical and Computer Modelling 26 (1997) 95-108