The complexity of generating robust resource-constrained baseline schedules

2 Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that will change little when variations in the input parameters arise. Robustness can also be achieved by making the schedule makespan insensitive to variability. In this paper, we describe models for the generation of stable and insensitive baseline schedules for resourceconstrained scheduling problems and present results on their complexity status. We start from a project scheduling viewpoint and derive results on machine scheduling sub-problems.

[1]  M. Selim Akturk,et al.  Match-up scheduling under a machine breakdown , 1999, Eur. J. Oper. Res..

[2]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[3]  Joseph Y.-T. Leung,et al.  Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time , 1991, Inf. Comput..

[4]  R. L. Daniels,et al.  β-Robust scheduling for single-machine systems with uncertain processing times , 1997 .

[5]  Franz Josef Radermacher,et al.  Algorithmic approaches to preselective strategies for stochastic scheduling problems , 1983, Networks.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[8]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[9]  Reha Uzsoy,et al.  Rescheduling on a single machine with part-type dependent setup times and deadlines , 1997, Ann. Oper. Res..

[10]  Frederik Stork,et al.  Stochastic resource-constrained project scheduling , 2001 .

[11]  Willy Herroelen,et al.  The construction of stable project baseline schedules , 2004, Eur. J. Oper. Res..

[12]  Jane N. Hagstrom,et al.  Computational complexity of PERT problems , 1988, Networks.

[13]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[14]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[15]  Willy Herroelen,et al.  A model for robust resource allocation in project scheduling , 2001 .

[16]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[17]  F. J. Radermacher,et al.  Chapter 4 – THE ORDER-THEORETIC APPROACH TO SCHEDULING: THE STOCHASTIC CASE , 1989 .

[18]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..