The complexity of machine scheduling for stability with a single disrupted job

Operations Research Letters

Volumn 33, Issue 2, 2005, Pages 151-156

  Leus, Roel ^a   Herroelen, Willy ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Complexity; Robustness; Scheduling; Stability; Uncertainty

Indexed keywords

MACHINE COMPONENTS; MATHEMATICAL OPERATORS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS); SYSTEM STABILITY; UNCERTAIN SYSTEMS;

IDENTICAL PARALLEL MACHINES; MACHINE SCHEDULING; PRE-SCHEDULE DURATION; PROJECT SCHEDULING SETTING;

SCHEDULING;

EID: 9644275655     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.04.008     Document Type: Article

References (25)

1. I. Adiri, J. Bruno, E. Frostig, A.H.G. Rinnooy Kan, Single machine flow-time scheduling with a single breakdown, Acta Inform. 36 (1989) 679-696.
2. M.S. Akturk, E. Gorgulu, Match-up scheduling under a machine breakdown, European J. Oper. Res. 112 (1999) 81-97.
3. H. Aytug, M.A. Lawley, K. McKay, S. Mohan, R. Uzsoy, Executing production schedules in the face of uncertainties: a review and some future directions, European J. Oper. Res. (2004), to appear.
4. J.C. Bean, J.R. Birge, J. Mittenthal, C.E. Noon, Match-up scheduling with multiple resources, release dates and disruptions, Oper. Res. 39 (1991) 470-483.
5. J. Bruno, E.G. Coffmann Jr., R. Sethi, Scheduling independent tasks to reduce mean finishing time, Comm. ACM 17 (1974) 382-387.
6. R.L. Daniels, J.E. Carrillo, β-robust scheduling for single-machine systems with uncertain processing times, IIE Trans. 29 (1997) 977-985.
7. R.L. Daniels, P. Kouvelis, Robust scheduling to hedge against processing time uncertainty in single-stage production, Management Sci. 41 (1995) 363-376.
8. J. Du, J.Y.-T. Leung, G.H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow time, Inform. Comput. 92 (1991) 219-236.
9. M.R. Garey, D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
10. N.G. Hall, C.N. Potts, Rescheduling for new orders, Oper. Res. (2004), to appear.
11. W. Herroelen, R. Leus, The construction of stable project baseline schedules, European J. Oper. Res. 156 (2004) 550-565.
12. P. Kouvelis, O. Yu, Robust Discrete Optimization and Its Applications, Kluwer Academic Publishers, Boston, 1997.
13. E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints, Manage. Sci. 19 (1973) 544-546.
14. E.L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Ann. Discrete Math. 2 (1978) 75-90.
15. J.K. Lenstra, A.H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Oper. Res. 26 (1978) 22-35.
16. J.K. Lenstra, A.H.G. Rinnooy Kan, P. Bruckcr, Complexity of machine scheduling problems, Ann. Discrete Math. 1 (1977) 343-362.
17. V.J. Leon, S.D. Wu, R.H. Storer, Robustness measures and robust scheduling for job shops, HE Trans. 26 (1994) 32-43.
18. S.V. Mehta, R.M. Uzsoy, Predictable scheduling of a job shop subject to breakdowns, IEEE Trans. Robot. Automat. 14 (1998) 365-378.
19. R. O'Donovan, R. Uzsoy, K.M. McKay, Predictable scheduling of a single machine with breakdowns and sensitive jobs, Internat J. Product. Res. 37 (1999) 4217-4233.
20. M. Pinedo, Scheduling. Theory, Algorithms and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
21. A.S. Raheja, V. Subramaniam, Reactive recovery of job shop schedules - a review, Internat. J. Adv. Manuf. Technol. 19 (2002) 756-763.
22. R. Rangsaritratsamee, W.G. Ferrel Jr., M.B. Kurz, Dynamic rescheduling that simultaneously considers efficiency and stability, Comput. Ind. Eng. 46 (2004) 1-15.
23. F. Stork, Stochastic resource-constrained project scheduling, Ph.D. Thesis, Technische Universität Berlin, 2001.
24. S.D. Wu, H.S. Storer, P.-C. Chang, One-machine rescheduling heuristics with efficiency and stability as criteria, Comput. Oper. Res. 20 (1993) 1-14.
25. J. Yáñez, J. Ramirez, The robust coloring problem, European J. Oper. Res. 148 (2003) 546-558.