The construction of stable project baseline schedules

The vast majority of project scheduling efforts assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. In reality, however, project activities are subject to considerable uncertainty, which generally leads to numerous schedule disruptions. It is of interest to develop pre-schedules that can absorb disruptions in activity durations without affecting the planning of other activities, such that co-ordination of resources and material procurement for each of the activities can be performed as smoothly as possible. The objective of this paper is to develop and evaluate various approaches for constructing a stable preschedule, which is unlikely to undergo major changes when it needs to be repaired as a reaction to minor activity duration disruptions.

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

[2]  Eugene Levner,et al.  A network flow algorithm for just-in-time project scheduling , 1994 .

[3]  J. O'Neill,et al.  Project management. , 2001, Health management technology.

[4]  Jack R. Meredith,et al.  Project Management: A Managerial Approach , 1989 .

[5]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[6]  D. R. Fulkerson.  A Network Flow Computation for Project Cost Curves , 1961 .

[7]  J. U. M. Smith,et al.  Project Risk Management: Processes, Techniques and Insights , 1998, J. Oper. Res. Soc..

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

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

[10]  Oguzhan Alagöz,et al.  Rescheduling of identical parallel machines under machine eligibility constraints , 2003, Eur. J. Oper. Res..

[11]  S. Selçuk Erengüç,et al.  The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure , 1998, Eur. J. Oper. Res..

[12]  Andrew V. Goldberg,et al.  An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.

[13]  Ahmet Bolat,et al.  Procedures for providing robust gate assignments for arriving aircrafts , 2000, Eur. J. Oper. Res..

[14]  James E. Kelley,et al.  Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[15]  D. Malcolm,et al.  Application of a Technique for Research and Development Program Evaluation , 1959 .

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

[17]  John Bowers,et al.  Criticality in Resource Constrained Networks , 1995 .

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

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

[20]  James C. Bean,et al.  Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..

[21]  Vidyadhar G. Kulkarni,et al.  A classified bibliography of research on stochastic PERT networks: 1966-1987 , 1989 .

[22]  J. D. Wiest,et al.  Management Guide to PERT/CPM , 1969 .

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

[24]  Jan Węglarz,et al.  Project scheduling : recent models, algorithms, and applications , 1999 .

[25]  U Dave,et al.  Critical Chain , 1998, J. Oper. Res. Soc..

[26]  Klaus Neumann,et al.  Active and stable project scheduling , 2000, Math. Methods Oper. Res..

[27]  J. Rosenhead,et al.  Robustness and Optimality as Criteria for Strategic Decisions , 1972 .

[28]  Mario Vanhoucke,et al.  A new random network generator for activity-on-the-node networks , 2000 .

[29]  Chung-Yee Lee,et al.  Multiple-Project Scheduling with Controllable Project Duration and Hard Resource Constraint: Some Solvable Cases , 2001, Ann. Oper. Res..

[30]  Sacramento Quintanilla,et al.  Project Scheduling with Stochastic Activity Interruptions , 1999 .

[31]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

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

[33]  S. Selcuk Erenguc,et al.  The resource constrained project scheduling problem with multiple crashable modes: An exact solution method , 2001 .