Heuristic Procedures for Generating Stable Project Baseline Schedules

Solution robust project scheduling is a growing research field aiming at constructing proactive schedules to cope with multiple disruptions during project execution. When stochastic activity durations are considered, including time buffers between activities is a proven method to improve the stability of a baseline schedule. This paper introduces multiple algorithms to include time buffers in a given schedule while a predefined project due date remains respected. Multiple efficient heuristic and meta-heuristic procedures are proposed to allocate buffers throughout the schedule. An extensive simulation-based analysis of the performance of all algorithms is given. The impact of the activity duration variance structure on the performance is discussed in detail.

[1]  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..

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

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

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

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

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

[7]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

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

[9]  Roel Leus,et al.  The generation of stable project plans , 2004, 4OR.

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

[11]  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..

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

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

[14]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..