Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem

The proactive and reactive resource-constrained project scheduling problem (PR-RCPSP), that has been introduced recently (Davari and Demeulemeester, 2017), deals with activity duration uncertainty in a very unique way. The optimal solution to an instance of the PR-RCPSP is a proactive and reactive policy (PR-policy) that is a combination of a baseline schedule and a set of required transitions (reactions). In this research, we introduce two interesting classes of reactions, namely the class of selection-based reactions and the class of buffer-based reactions, the latter in fact being a subset of the class of selection-based reactions. We also discuss the theoretical relevance of these two classes of reactions. We run some computational results and report the contributions of the selection-based reactions and the buffer-based reactions in the optimal solution. The results suggest that although both selection-based reactions and buffer-based reactions contribute largely in the construction of the optimal PR-policy, the contribution of the buffer-based reactions is of much greater importance. These results also indicate that the contributions of non-selection-based reactions (reactions that are not selection-based) and selection-but-not-buffer-based reactions (selection-based reactions that are not buffer-based) are very limited.

[1]  M. Golumbic.  CHAPTER 5 – Comparability Graphs , 1980 .

[2]  Roel Leus,et al.  Resource allocation by means of project networks: Complexity results , 2011, Networks.

[3]  Roel Leus.  Resource allocation by means of project networks: Dominance results , 2011, Networks.

[4]  Ling Wang,et al.  An estimation of distribution algorithm and new computational results for the stochastic resource-constrained project scheduling problem , 2015, Flexible Services and Manufacturing Journal.

[5]  Roel Leus,et al.  New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing , 2011, J. Sched..

[6]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[7]  Ramón Alvarez-Valdés Olaguíbel,et al.  The project scheduling polyhedron: Dimension, facets and lifting theorems , 1993 .

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

[9]  Jay H. Lee,et al.  Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling application , 2004, Comput. Chem. Eng..

[10]  Salim Rostami,et al.  New strategies for stochastic resource-constrained project scheduling , 2017, Journal of Scheduling.

[11]  Erik Demeulemeester,et al.  Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities , 2008, J. Sched..

[12]  Christoph Schwindt,et al.  Resource allocation in project management , 2005 .

[13]  Francisco Ballestín,et al.  When it is worthwhile to work with the stochastic RCPSP? , 2007, J. Sched..

[14]  Morteza Davari.  Contributions to complex project and machine scheduling problems. , 2017 .

[15]  Erik Demeulemeester,et al.  Proactive heuristic procedures for robust project scheduling: An experimental analysis , 2008, Eur. J. Oper. Res..

[16]  Salim Rostami,et al.  New Benchmark Results for the Stochastic Resource-Constrained Project Scheduling Problem , 2015, IEEM 2015.

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

[18]  Haitao Li,et al.  Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming , 2015, Eur. J. Oper. Res..

[19]  Stefan Creemers,et al.  Minimizing the expected makespan of a project with stochastic activity durations under resource constraints , 2015, J. Sched..

[20]  Erik Demeulemeester,et al.  A Novel Branch-and-Bound Algorithm for the Chance-Constrained RCPSP , 2016 .

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

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

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

[24]  Franz Josef Radermacher,et al.  Preselective strategies for the optimization of stochastic project networks under resource constraints , 1983, Networks.

[25]  Roel Leus,et al.  Resource‐Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations , 2007 .

[26]  Erik Demeulemeester,et al.  The proactive and reactive resource-constrained project scheduling problem , 2016, J. Sched..

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

[28]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

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

[30]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[31]  Christian Artigues,et al.  Robust optimization for resource-constrained project scheduling with uncertain activity durations , 2011, Flexible Services and Manufacturing Journal.

[32]  Erik Demeulemeester,et al.  Heuristic Procedures for Reactive Project Scheduling , 2006, Comput. Ind. Eng..