Evaluating project completion time in project networks with discrete random activity durations. (English) Zbl 1160.90491
Summary: Deterministic models for project scheduling suffer from the fact that they assume complete information and neglect random influences, that occur during project execution. A typical consequence is the underestimation of the project duration as frequently observed in practice. This phenomenon occurs even in the absence of resource constraints and has been the subject of extensive research in the scientific community. This paper presents a method for obtaining relevant information about the project makespan for scheduling models, with dependent random processing time available in the form of scenarios.
References:
| [1] | Jaafari, A., Management of risks, uncertainties and opportunities on projects: time for a fundamental shift, International Journal of Project Management, 19, 2, 89-101 (2001) |
| [2] | Perminova, O.; Gustafsson, M.; Wikström, K., Defining uncertainty in projects a new perspective, International Journal of Project Management, 26, 73-79 (2008) |
| [3] | Atkinson, R.; Crawford, L.; Ward, S., Fundamental uncertainties in projects and the scope of project management, International Journal of Project Management, 24, 687-698 (2006) |
| [4] | Van Slyke, R. M., Monte Carlo methods and the PERT problem, Operations Research, 11, 849-860 (1963) |
| [5] | Sullivan, R. H.; Hayya, J. C., A comparison of the method of bounding distribution (MBD) and Monte Carlo simulation for analyzing stochastic acyclic networks, Operations Research, 28, 614-617 (1980) |
| [6] | Herrera L. Stochastic critical path. In: Proceeding of the 2006 cristal ball user conference; 2006.; Herrera L. Stochastic critical path. In: Proceeding of the 2006 cristal ball user conference; 2006. |
| [7] | Shih, N. H., Estimating completion-time distribution in stochastic activity networks, Journal of the Operational Research Society, 56, 744-749 (2005) · Zbl 1095.90021 |
| [8] | Dodin, B., Bounding the project completion time of PERT network, Operations Research, 33, 862-865 (1985) · Zbl 0579.90055 |
| [9] | Hagstrom, J. M., Computing the probability distribution of project duration in a PERT network, Networks, 20, 231-244 (1990) · Zbl 0689.90029 |
| [10] | Fulkerson, D. R., Expected critical path lengths in PERT networks, Operations Research, 10, 6, 808-817 (1962) · Zbl 0124.36304 |
| [11] | Soroush, H. M., The most critical path in a PERT network, The Journal of Operational Research society, 45, 3, 287-300 (1994) · Zbl 0797.90024 |
| [12] | Elmaghraby, S. E., The estimation of some network parameters in PERT model of activity network: review and critique, (Slowinski, R.; Weglarz, J., Advances in project scheduling, Part III (1989), Elsevier: Elsevier Amsterdam), 371-432 |
| [13] | Yao, M. J.; Chu, W. M., A new approximation algorithm for obtaining the probability distribution function for project completion time, Computers and Mathematics with Applications, 54, 282-295 (2007) · Zbl 1235.62149 |
| [14] | Hagstrom, J. M., Computational complexity of PERT problems, Networks, 18, 139-147 (1988) |
| [15] | Schuyler J. Risk and decision analysis in projects. Project Management Institute; 2001.; Schuyler J. Risk and decision analysis in projects. Project Management Institute; 2001. |
| [16] | Malcolm, D. G.; Roseboom, J. H.; Clark, C. E.; Fazar, W., Application of a technique for research and development program evaluation, Operations Research, 7, 5, 656-669 (1959) · Zbl 1255.90070 |
| [17] | Elmaghraby, S. E., On the fallacy of averages in project risk management, European Journal of Operational Research, 165, 307-331 (2005) · Zbl 1066.90530 |
| [18] | Charnes, A.; Cooper, W. W.; Thompson, G. L., Critical path analyses via chance constrained and stochastic programming, Operations Research, 12, 3, 460-470 (1964) · Zbl 0125.09602 |
| [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] | Prékopa, A., Stochastic programming (1995), Kluwer Scientific Publisher: Kluwer Scientific Publisher Boston · Zbl 0834.90098 |
| [21] | Kolisch, R.; Sprecher, A., PSPLIBa project scheduling problem library, European Journal of Operational Research, 96, 205-216 (1997) · Zbl 0947.90587 |
| [22] | Guerriero F, Talarico L. A solution approach to find the critical path in a time-constrained activity network. Technical report, ParCoLab, DEIS, University of Calabria, July 2007, Computers and Operations Research, under review.; Guerriero F, Talarico L. A solution approach to find the critical path in a time-constrained activity network. Technical report, ParCoLab, DEIS, University of Calabria, July 2007, Computers and Operations Research, under review. · Zbl 1190.90033 |
| [23] | Cooper, D. F., Heuristics for scheduling resource-constrained projects: an experimental investigation, Management Science, 22, 11, 1186-1194 (1976) · Zbl 0326.90029 |
| [24] | Bisschop J, Roelofs M. AIMMS. 3.7 user’s guide. The Netherlands: Paragon Decision Technology B.V.; 2007.; Bisschop J, Roelofs M. AIMMS. 3.7 user’s guide. The Netherlands: Paragon Decision Technology B.V.; 2007. |
| [25] | ILOG CPLEX 10.1: User’s manual. Incline Village, NV: CPLEX Optimization, Inc.; 2006.; ILOG CPLEX 10.1: User’s manual. Incline Village, NV: CPLEX Optimization, Inc.; 2006. |
| [26] | Bruni ME, Guerriero F, Pinto E. Solution approaches to find the \(\operatorname{Α;} \); Bruni ME, Guerriero F, Pinto E. Solution approaches to find the \(\operatorname{Α;} \) |
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.
