Proactive-Reactive Project Scheduling Trade-Offs and Procedures

The vast majority of the research efforts in project scheduling over the past several years have concentrated on the development of exact and heuristic procedures for the generation of a workable baseline schedule assuming complete information and a static and deterministic environment. During project execution, however, a project may be subject to considerable uncertainty. Proactive-reactive project scheduling deals with uncertainty by creating a baseline schedule that is as much as possible protected against disruptions and by deploying reactive scheduling procedures to revise or reoptimize this schedule when necessary. This chapter focuses on the main principles of proactive-reactive scheduling and dwells on schedule robustness and its measurements. A number of recently developed proactive and reactive scheduling heuristics are described and their working principles are illustrated on a problem example

[1]  Willy Herroelen,et al.  Stability and resource allocation in project planning , 2004 .

[2]  Erik Demeulemeester,et al.  Heuristic Procedures for Generating Stable Project Baseline Schedules , 2005 .

[3]  Walter O. Rom,et al.  An investigation of buffer sizing techniques in critical chain scheduling , 2006, Eur. J. Oper. Res..

[4]  Jean-Charles Billaut,et al.  Maximization of solution flexibility for robust shop scheduling , 2005, Eur. J. Oper. Res..

[5]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[6]  Reha Uzsoy,et al.  Executing production schedules in the face of uncertainties: A review and some future directions , 2005, Eur. J. Oper. Res..

[7]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[8]  Erik Demeulemeester,et al.  An investigation of efficient and effective predictive-reactive project scheduling procedures , 2004 .

[9]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[10]  Rainer Kolisch,et al.  Efficient priority rules for the resource-constrained project scheduling problem , 1996 .

[11]  Gideon Weiss,et al.  Stochastic scheduling problems II-set strategies- , 1985, Z. Oper. Research.

[12]  F. Roubellat,et al.  A new method for workshop real time scheduling , 1996 .

[13]  Willy Herroelen,et al.  On the merits and pitfalls of critical chain scheduling , 2000 .

[14]  Robert C. Newbold,et al.  Project Management in the Fast Lane: Applying the Theory of Constraints , 1998 .

[15]  Erik Demeulemeester,et al.  New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .

[16]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

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

[18]  Willy Herroelen,et al.  Project scheduling under uncertainty: Survey and research potentials , 2005, Eur. J. Oper. Res..

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

[20]  Erik Demeulemeester,et al.  A note on the paper "Resource-constrained project scheduling: Notation, classification, models and methods" by Brucker et al , 2001, Eur. J. Oper. Res..

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

[22]  R. Leus,et al.  The trade-off between stability and makespan in resource-constrained project scheduling , 2004 .

[23]  François Roubellat,et al.  Characterization of a set of schedules in a multiple resource context , 1996 .

[24]  Luís Valadares Tavares,et al.  On the optimal management of project risk , 1998, Eur. J. Oper. Res..

[25]  Gideon Weiss,et al.  Stochastic scheduling problems I — General strategies , 1984, Z. Oper. Research.

[26]  Willy Herroelen,et al.  The complexity of machine scheduling for stability with a single disrupted job , 2005, Oper. Res. Lett..

[27]  Erik Demeulemeester,et al.  Critical Chain Project Scheduling: Do Not Oversimplify , 2002 .

[28]  Reha Uzsoy,et al.  Predictable scheduling of a job shop subject to breakdowns , 1998, IEEE Trans. Robotics Autom..

[29]  Salah E. Elmaghraby,et al.  Note on the paper 'Resource-constrained project management using enhanced theory of constraint' by Wei et al. , 2003 .

[30]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[31]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

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

[33]  Christian Artigues,et al.  A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes , 2000, Eur. J. Oper. Res..

[34]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[35]  Erik Demeulemeester,et al.  The use of buffers in project management: The trade-off between stability and makespan , 2004 .

[36]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[37]  Erik Demeulemeester,et al.  An Exact Procedure for the Resource-Constrained Weighted Earliness–Tardiness Project Scheduling Problem , 2001, Ann. Oper. Res..

[38]  Erik Demeulemeester,et al.  RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..

[39]  Bernard Roy,et al.  Robustesse de quoi et vis-à-vis de quoi mais aussi robustesse pourquoi en aide à la décision ? , 2004 .