Resource‐Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations

We investigate resource-constrained project scheduling with stochastic activity durations. Various objective functions related to timely project completion are examined, as well as the correlation between these objectives. We develop a GRASP-heuristic to produce high-quality solutions, using so-called descriptive sampling. The algorithm outperforms other existing algorithms for expected-makespan minimization. The distribution of the possible makespan realizations for a given scheduling policy is studied, and problem difficulty is explored as a function of problem parameters.

[1]  John R. Schuyler,et al.  Risk and Decision Analysis in Projects , 2001 .

[2]  Kristian Linnet,et al.  Testing normality of transformed data , 1988 .

[3]  S. French.  Decision Theory: An Introduction to the Mathematics of Rationality , 1986 .

[4]  Alain Bensoussan,et al.  Risk and Decision Analysis , 2009, Risk Decis. Anal..

[5]  A. A. Mastor,et al.  An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .

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

[7]  Philippe Jorion.  Value at risk: the new benchmark for controlling market risk , 1996 .

[8]  M. Bayiz,et al.  Coordination and Incentive Contracts in Project Management under Asymmetric Information , 2005 .

[9]  Dimitri Golenko-Ginzburg,et al.  Stochastic network project scheduling with non-consumable limited resources , 1997 .

[10]  Anand Paul,et al.  Robustness to Variability in Project Networks , 2001 .

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

[12]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[13]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[14]  Bert De Reyck,et al.  DEPARTEMENT TOEGEPASTE ECONOMISCHE WETENSCHAPPEN PHASE TRANSITIONS IN PROJECT SCHEDULING , 2022 .

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

[16]  James H. Patterson,et al.  A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem , 1984 .

[17]  Yahya Fathi,et al.  On the sensitivity of project variability to activity mean duration , 1999 .

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

[19]  K. McConway,et al.  Decision Theory: An Introduction to the Mathematics of Rationality , 1986 .

[20]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

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

[22]  B. Yum,et al.  An uncertainty importance measure of activities in PERT networks , 1997 .

[23]  Tad Hogg,et al.  Phase Transitions in Artificial Intelligence Systems , 1987, Artif. Intell..

[24]  Celso C. Ribeiro,et al.  Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.

[25]  Brian Hayes,et al.  CAN’T GET NO SATISFACTION , 1997 .

[26]  Bajis M. Dodin,et al.  Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops , 1996, Comput. Oper. Res..

[27]  Douglas D. Gemmill,et al.  Using tabu search to schedule activities of stochastic resource-constrained projects , 1998, Eur. J. Oper. Res..

[28]  R. Wollmer.  Critical path planning under uncertainty , 1985 .

[29]  Andrew Ang,et al.  Downside Risk , 2004 .

[30]  Willy Herroelen,et al.  Project Scheduling—Theory and Practice , 2005 .

[31]  David F. Pyke,et al.  Inventory management and production planning and scheduling , 1998 .

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

[33]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .

[34]  Yigal Gerchak,et al.  On the allocation of uncertainty-reduction effort to minimize total variability , 2000 .

[35]  George Apostolakis,et al.  Decision theory , 1986 .

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

[37]  Bert De Reyck,et al.  A hybrid scatter search/electromagnetism meta-heuristic for project scheduling , 2006, Eur. J. Oper. Res..

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

[39]  R. Kolisch,et al.  Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis , 1998 .

[40]  Gündüz Ulusoy,et al.  A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis , 1996 .

[41]  Dan Trietsch,et al.  Makespan-related criteria for comparing schedules in stochastic environments , 1998, J. Oper. Res. Soc..

[42]  Stephen L. Cabano,et al.  Project management in the fast lane , 2001 .

[43]  Floyd H. Grant.  Note-A Note on Efficiency of the Antithetic Variate Method for Simulating Stochastic Networks , 1983 .

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

[45]  Rolf H. Möhring,et al.  A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks , 2001, Ann. Oper. Res..

[46]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

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

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

[49]  Michael J. Magazine,et al.  A Classified Bibliography of Research on Optimal Design and Control of Queues , 1977, Oper. Res..

[50]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

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

[52]  Francisco Ballestín,et al.  Justification and RCPSP: A technique that pays , 2005, Eur. J. Oper. Res..

[53]  Robert J Willis,et al.  An iterative scheduling technique for resource-constrained project scheduling , 1992 .

[54]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

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

[56]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

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

[58]  Dale F. Cooper,et al.  Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation , 1976 .

[59]  Jack C. Hayya,et al.  Efficiency of the Antithetic Variate Method for Simulating Stochastic Networks , 1982 .

[60]  D. J. White,et al.  Decision Theory , 2018, Behavioral Finance for Private Banking.

[61]  Kin Keung Lai,et al.  Risk avoidance in bidding for software projects based on life cycle management theory , 2006 .

[62]  Athanassios N. Avramidis,et al.  Simulation of stochastic activity networks using path control variates , 1991 .

[63]  Rema Padman,et al.  An integrated survey of deterministic project scheduling , 2001 .

[64]  Christine Strauss,et al.  A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management , 2000, INFORMS J. Comput..

[65]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

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

[67]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[68]  Eduardo Saliby.  Descriptive sampling: an improvement over Latin hypercube sampling , 1997, WSC '97.

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

[70]  Andrew W. Shogan,et al.  Semi-greedy heuristics: An empirical study , 1987 .

[71]  Eduardo Saliby,et al.  Descriptive Sampling: A Better Approach to Monte Carlo Simulation , 1990 .

[72]  Ralph B. D'Agostino,et al.  Goodness-of-Fit-Techniques , 2020 .