Abstract
Resource-constrained project scheduling has been widely investigated in the academic literature, but the issue of the incorporation of uncertainty in project scheduling has received a growing research attention only in the last 15 years. This chapter gives an overview of models and methods for the resource-constrained project scheduling under uncertainty. The case of known deterministic renewable resource requirements and random activity durations with a known probability distribution function is studied in detail. In particular, we show how, through the use of joint probabilistic constraints, a feasible baseline schedule with minimum makespan can be built, which is able to tolerate a certain degree of uncertainty and to absorb dynamic variations in activity durations. The use of joint probabilistic constraints, within the stochastic scheduling problem, represents an innovative element in the literature and enables the relaxation of the common assumption that only one activity at a time disturbs the starting time of a successor activity, rather limiting the joint probability of disruption of the preceding activities to a given probability level. The results obtained with the proposed heuristics are discussed and compared with two well known heuristics taken from the literature on a set of randomly generated project instances. A practical application concerning a real project for construction of students’ apartments at the University of Calabria, Italy, is also illustrated. Based on the analysis of the various researches discussed in this chapter, avenues for future research will be also outlined.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alvarez-Valdes R, Tamarit JM (1989) Heuristic algorithms for resource constrained project scheduling. A review and an empirical analysis. In: Słowiński R, Wȩglarz J (eds) Advances in project scheduling. Elsevier, Amsterdam, pp 113–134
Ashtiani B, Leus R, Aryanezhad, MB (2011) New competitive results for the stochastic resource constrained project scheduling problem: exploring the benefits of preprocessing. J Sched 14:157–171
Atkinson R, Crawford L, Ward S (2006) Fundamental uncertainties in projects and the scope of project management. Int J Proj Manag 24:687–698
BallestĂn F (2007) When it is worthwhile to work with the stochastic RCPSP? J Sched 10:153–166
BallestĂn F, Leus R (2009) Resource-constrained project scheduling for timely project completion with stochastic activity durations. Prod Oper Manag 18:459–474
Bruni ME, Beraldi P, Guerriero F, Pinto E (2011a) A heuristic approach for resource constrained project scheduling with uncertain activity durations. Comput Oper Res 38:1305–1318
Bruni ME, Beraldi P, Guerriero F, Pinto E (2011b) A scheduling methodology for dealing with uncertainty in construction projects. Eng Comput 28(8):1064–1078
Davis E, Patterson J (1975) A comparison of heuristic and optimum solutions in resource constrained project scheduling. Manag Sci 21:944–955
Deblaere F, Demeulemeester E, Herroelen W, Van de Vonder S (2007) Robust resource allocation decisions in resource-constrained projects. Decis Sci 38:1–37
Dentcheva D, Prékopa A, Ruszczyński A (1998) On stochastic integer programming under probabilistic constraints. Research Report RRR29-98, RUTCOR Rutgers Center for Operations Research, Rutgers University, Newark
Goldratt EM (1997) Critical chain. The North River Press, Great Barrington
Golenko-Ginzburg D, Gonik A (1997) Stochastic network project scheduling with non-consumable limited resources. Int J Prod Econ 48:29–37
Golenko-Ginzburg D, Gonik A (1998) A heuristic for network project scheduling with random activity durations depending on the resource allocation. Int J Prod Econ 55:149–162
Graham RL (1966) Bounds on multiprocessing timing anomalies. Bell Syst Tech J 45:1563–1581
Igelmund G, Radermacher FJ (1983a) Algorithmic approaches to preselective strategies for stochastic scheduling problems. Networks 13:29–48
Igelmund G, Radermacher FJ (1983b) Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks 13:1–28
Jaafari A (2001) Management of risks, uncertainties and opportunities on projects: time for a fundamental shift. Int J of Proj Manag 19(2):89–101
Jagannathan R (1974) Chance-constrained programming with joint constraints. Oper Res 22(2):358–372
Kim K, Garza MJ (2005) Evaluation of the resource-constrained critical path method algorithms. J Constr Eng Manag 131(5):522–532
Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis. In: Wȩglarz J (ed) Project scheduling: recent models, algorithms and applications. Kluwer, Dordrecht, pp 147–178
Kolisch R, Sprecher A (1997) PSPLIB a project scheduling problem library. Eur J Oper Res 96:205–216
Lambrechts O, Demeulemeester E, Herroelen W (2007) A tabu search procedure for developing robust predictive project schedules. Int J Prod Econ 111(2):496–508
Malcolm DG, Roseboom JH, Clark CE, Fazar W (1959) Application of a technique for research and development program evaluation. Oper Res 7(5):656–669
Mehta SV, Uzsoy RM (1998) Predictable scheduling of a job shop subject to break-downs. IEEE T Roboti Autom 14(3):365–378
Miller BL, Wagner HM (1965) Chance constrained programming with joint constraints. Oper Res 13(6):930–945
Möhring RH, Stork F (2000) Linear preselective strategies for stochastic project scheduling. Math Method Oper Res 52(3):501–515
Nkasu MM (1994) COMSARS: a computer-sequencing approach to multiresource-constrained scheduling – Part 1: deterministic networks. Int J Proj Manag 12(3):183–192
Perminova O, Gustafsson M, Wikstrom K (2008) Defining uncertainty in projects a new perspective. Int J Proj Manag 26:73–79
Prékopa, A (1995) Stochastic programming. Kluwer Academic, Boston
Rabbani M, Fatemi Ghomi SMT, Jolai F, Lahiji NS (2007) A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept. Eur J Oper Res 176:794–808
Radermacher FJ (1981) Optimale Strategien fĂĽr stochastische Scheduling-Probleme. Habilitation thesis, RWTH Aachen, Aachen, Germany. In: Schriften zur Informatik und angewandten Mathematik 98, RWTH Aachen
Stork F (2001) Stochastic resource-constrained project scheduling. Ph.D. dissertation, Technische Universität Berlin, Berlin
Tsai YW, Gemmil DD (1998) Using tabu search to schedule activities of stochastic resource-constrained projects. Eur J Oper Res 111:129–141
Van De Vonder S, Demeulemeester E, Herroelen W, Leus R (2006) The trade-off between stability and makespan in resource-constrained project scheduling. Int J Prod Res 44(2):215–236
Van de Vonder S, Demeulemeester E, Herroelen W (2008) Proactive heuristic procedures for robust project scheduling: an experimental analysis. Eur J Oper Res 189:723–733
Zhu G, Bard JF, Yu G (2007) A two-stage stochastic programming approach for project planning with uncertain activity durations. J Sched 10:167–180
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bruni, M.E., Beraldi, P., Guerriero, F. (2015). The Stochastic Resource-Constrained Project Scheduling Problem. In: Schwindt, C., Zimmermann, J. (eds) Handbook on Project Management and Scheduling Vol. 2. International Handbooks on Information Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-05915-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-05915-0_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05914-3
Online ISBN: 978-3-319-05915-0
eBook Packages: Business and EconomicsBusiness and Management (R0)