Bruni, M. E.; Beraldi, P.; Guerriero, F.; Pinto, E. A heuristic approach for resource constrained project scheduling with uncertain activity durations. (English) Zbl 1208.90055 Comput. Oper. Res. 38, No. 9, 1305-1318 (2011). Summary: We address the resource constrained project scheduling problem with uncertain activity durations. Project activities are assumed to have known deterministic renewable resource requirements and uncertain durations, described by independent random variables with a known probability distribution function. To tackle the problem solution we propose a heuristic method which relies on a stage wise decomposition of the problem and on the use of joint probabilistic constraints. Cited in 8 Documents MSC: 90B35 Deterministic scheduling theory in operations research 90C59 Approximation methods and heuristics in mathematical programming Keywords:resource constrained project scheduling; random activity duration; heuristic; joint chance constraints programming Software:PSPLIB; CPLEX; CONOPT; AIMMS PDFBibTeX XMLCite \textit{M. E. Bruni} et al., Comput. Oper. Res. 38, No. 9, 1305--1318 (2011; Zbl 1208.90055) Full Text: DOI References: [1] Aytug, H.; Lawley, M. A.; McKay, K.; Mohan, S.; Uzsoy, R., Executing production schedules in the face of uncertainties: a review and some future directions, European Journal of Operational Research, 161, 86-110 (2005) · Zbl 1115.90025 [2] Mehta, S. V.; Uzsoy, R. M., Predictable scheduling of a job shop subject to breakdowns, IEEE Transactions on Robotics and Automation, 14, 3, 365-378 (1998) [3] Wang, J., Constraint-based schedule repair for product development projects with time-limited constraints, International Journal of Production Economics, 95, 399-414 (2005) [4] Zhu, G.; Bard, J. F.; Yu, G., Disruption management for resource-constrained project scheduling, Journal of the Operational Research Society, 56, 365-381 (2005) · Zbl 1104.90025 [5] Igelmund, G.; Radermacher, F. J., Algorithmic approaches to preselective strategies for stochastic scheduling problems, Networks, 13, 29-48 (1983) · Zbl 0504.90040 [6] Mohring, R. H.; Stork, F., Linear preselective policies for stochastic project scheduling, Mathematical Methods of Operations Research, 52, 501-515 (2000) · Zbl 1023.90033 [7] Stork F. Branch-and-bound algorithms for stochastic resource-constrained project scheduling. Research Report. 702/2000. Technische Universitat, Berlin; 2000.; Stork F. Branch-and-bound algorithms for stochastic resource-constrained project scheduling. Research Report. 702/2000. Technische Universitat, Berlin; 2000. [8] Ballestin, F., When it is worthwhile to work with the stochastic RCPSP?, Journal of Scheduling, 10, 153-166 (2007) · Zbl 1168.90486 [9] Golenko-Ginzburg, D.; Gonik, A., A heuristic for network project scheduling with random activity durations depending on the resource allocation, International Journal on Production Economics, 55, 149-162 (1998) [10] Golenko-Ginzburg, D.; Gonik, A., Stochastic network project scheduling with non-consumable limited resources, International Journal of Production Economics, 48, 29-37 (1997) [11] Tsai, Y. W.; Gemmil, D. D., Using tabu search to schedule activities of stochastic resource-constrained projects, European Journal of Operational Research, 111, 129-141 (1998) · Zbl 0948.90072 [12] Van de Vonder, S.; Demeulemeester, E.; Herroelen, W.; Leus, R., The use of buffers in project management: the trade-off between stability and makespan, International Journal of Production Economics, 97, 227-240 (2005) [13] Van De Vonder, S.; Demeulemeester, E.; Herroelen, W.; Leus, R., The trade-off between stability and makespan in resource-constrained project scheduling, International Journal of Production Research, 44, 2, 215-236 (2006) [14] Artigues, C.; Michelon, P.; Reusser, S., Insertion techniques for static and dynamic resource-constrained project scheduling, European Journal of Operational Research, 149, 249-267 (2003) · Zbl 1040.90013 [15] Leus R. The generation of stable project plans. PhD thesis, Department of Applied Economics, Katholieke Universiteit Leuven, Belgium; 2003.; Leus R. The generation of stable project plans. PhD thesis, Department of Applied Economics, Katholieke Universiteit Leuven, Belgium; 2003. · Zbl 1136.90354 [16] Van de Vonder, S.; Demeulemeester, E.; Herroelen, W., A classification of predictive-reactive project scheduling procedures, Journal of Scheduling, 10, 195-207 (2007) · Zbl 1168.90474 [17] Herroelen, W.; Leus, R., Robust and reactive project scheduling: a review and classification of procedures, International Journal of production Research, 42, 8, 1599-1620 (2004) [18] Herroelen, W.; Leus, R., Project scheduling under uncertainty—survey and research potentials, European Journal of Operational Research, 165, 2, 289-306 (2005) · Zbl 1066.90050 [19] Herroelen, W.; Leus, R., The construction of stable project baseline schedules, European Journal of Operational Research, 156, 550-565 (2004) · Zbl 1056.90066 [20] Rabbani, M.; Fatemi Ghomi, S. M.T.; Jolai, F.; Lahiji, N. S., A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept, European Journal of Operational Research, 176, 794-808 (2007) · Zbl 1103.90047 [21] Tavares, L. V.; Ferreira, J. A.A.; Coelho, J. S., On the optimal management of project risk, European Journal of Operational Research, 107, 451-469 (1998) · Zbl 0943.90043 [22] Leus, R.; Herroelen, W., Stability and resource allocation in project planning, IIE Transactions, 36, 667-682 (2004) [23] Deblaere, F.; Demeulemeester, E.; Herroelen, W.; Van de Vonder, S., Robust resource allocation decisions in resource-constrained projects, Decision Sciences, 38, 1-37 (2007) [24] Lambrechts, O.; Demeulemeester, E.; Herroelen, W., A tabu search procedure for developing robust predictive project schedules, International Journal of Production Economics, 111, 2, 496-508 (2007) [25] Lambrechts, O.; Demeulemeester, E.; Herroelen, W., Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities, Journal of Scheduling, 11, 2, 121-136 (2008) · Zbl 1168.90453 [26] Zhu, G.; Bard, J. F.; Yu, G., A two-stage stochastic programming approach for project planning with uncertain activity durations, Journal of Scheduling, 10, 167-180 (2007) · Zbl 1168.90570 [27] Klerides, E.; Hadjiconstantinou, E., A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations, Computers and Operations Research, 37, 12, 2131-2140 (2010) · Zbl 1231.90114 [28] Van de Vonder, S.; Demeulemeester, E.; Herroelen, W., Proactive heuristic procedures for robust project scheduling: an experimental analysis, European Journal of Operational Research, 189, 723-733 (2008) · Zbl 1146.90430 [29] Wiest, J. D.; Levy, F. K., A management guide to PERT/CPM with GERT/PDM/DCPM and other networks (1977), Prentice-Hall: Prentice-Hall New Jersey [30] Jagannathan, R., Chance-constrained programming with joint constraints, Operations Research, 22, 2, 358-372 (1974) · Zbl 0278.90054 [31] Miller, B. L.; Wagner, H. M., Chance constrained programming with joint constraints, Operations Research, 13, 6, 930-945 (1965) · Zbl 0132.40102 [32] Prékopa, A., Stochastic programming (1995), Kluwer Academic Publishers: Kluwer Academic Publishers Boston · Zbl 0834.90098 [33] Dentcheva D, Prékopa A, Ruszczyński A. On stochastic integer programming under probabilistic constraints. RUTCOR-Rutgers Center for Operations Research RRR 29-98, Rutgers University, 640 Bartholomew Road Piscataway, New Jersey 08854-8003, USA; 1998.; Dentcheva D, Prékopa A, Ruszczyński A. On stochastic integer programming under probabilistic constraints. RUTCOR-Rutgers Center for Operations Research RRR 29-98, Rutgers University, 640 Bartholomew Road Piscataway, New Jersey 08854-8003, USA; 1998. [34] Kolisch, R.; Hartmann, S., Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis, (Weglarz, J., Project scheduling: recent models, algorithms and applications (1999), Kluwer: Kluwer Amsterdam, The Netherlands), 147-178 [35] Davis, E.; Patterson, J., A comparison of heuristic and optimum solutions in resource constrained project scheduling, Management Science, 21, 944-955 (1975) [36] Alvarez-Valdes, R.; Tamarit, J. M., Heuristic algorithms for resource constrained project scheduling, (Slowinski, R.; Weglarz, J., A review and an empirical analysis. Advances in project scheduling (1989), Elsevier: Elsevier Amsterdam), 113-134 · Zbl 1122.90036 [37] Bisschop J, Roelofs M. AIMMS. 3.7 User’s guide. Paragon Decision Technology B.V., Incline Village, NV, The Netherlands: Optimization, Inc.; 2006.; Bisschop J, Roelofs M. AIMMS. 3.7 User’s guide. Paragon Decision Technology B.V., Incline Village, NV, The Netherlands: Optimization, Inc.; 2006. [38] CPLEX, ILOG CPLEX 6.5: Users Manual, Incline Village, NV: CPLEX Optimization, Inc.; 1999.; CPLEX, ILOG CPLEX 6.5: Users Manual, Incline Village, NV: CPLEX Optimization, Inc.; 1999. [39] Drud A. S. CONOPT: a system for large scale nonlinear optimization. Reference manual for CONOPT subroutine library, ARKI Consulting and Development A/S, Bagsvaerd, Denmark; 1996.; Drud A. S. CONOPT: a system for large scale nonlinear optimization. Reference manual for CONOPT subroutine library, ARKI Consulting and Development A/S, Bagsvaerd, Denmark; 1996. [40] Kolisch, R.; Sprecher, A., PSPLIB a project scheduling problem library, European Journal of Operational Research, 96, 205-216 (1997) · Zbl 0947.90587 [41] Beraldi P, Bruni ME, Guerriero F, Pinto E. Heuristic procedures for the robust project scheduling problem. Technical Report, ParCoLab, DEIS, University of Calabria; 2007.; Beraldi P, Bruni ME, Guerriero F, Pinto E. Heuristic procedures for the robust project scheduling problem. Technical Report, ParCoLab, DEIS, University of Calabria; 2007. This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.