Abstract
Main drawback of the traditional PERT modeling is that the probabilistic characteristics determined for the project completion time are only valid when it is supposed that any activity can be started promtly after executing all of its predecessor activities. This is possible in the case of scheduling computer tasks, however it is hardly possible in many other cases, like architectural project planning what is one of the the most important applicational areas of PERT modeling. In the paper a stochastic programming based PERT modeling will be introduced. This modeling will produce deterministic earliest starting times for the activities of the project. These deterministic starting times will be attainable with prescribed probability. So we also get an estimated project completion time what is attainable with the same prescribed probability. Numerical examples will be given for comparing the traditional and the newly introduced PERT modeling techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Clingen, C.T. (1964): A modification of Fulkerson’s PERT algorithm. Operations Research 12, 629–632
Devroye, L.P. (1979): Inequalities for the completion time of stochastic PERT networks. Mathematics of Operations Research 4, 441–447
Dodin, B.M. (1985): Bounding the project completion time distribution in PERT networks. Operations Research 33, 862–881
Elmaghraby, S.E. (1967): On the expected duration PERT type networks. Management Science 13, 299–306.
Fourer, R., Gay, D.M., Kernighan, B.W. (1993): AMPL A Modeling Language for Mathematical Programming. Boyd & Fraser Publishing Company, Danvers Massachusetts
Fulkerson, D.R. (1962): Expected critical path lengths in PERT networks. Operations Research 10, 808–817
Kleindorfer, G.B. (1971): Bounding distributions for a stochastic acyclic network. Operations Research 19, 1586–1601
Long, J., Prékopa, A., Szántai, T. (2004): New bounds and approximations for the probability distribution of the length of the critical path. In: Marti, K., Ermoliev, Yu., Pflug, G. (Eds.): Dynamic Stochastic Optimization. Lecture Notes in Economics and Mathematical Systems, 532, Proceedings of the IFIP/IIASA/GAMM/-Workshop on “Dynamic Stochastic Optimization”, held at the International Institute for Applied Systems Analysis — IIASA, Laxenburg/Vienna, Austria, March 11–14, 2002, Springer-Verlag, Berlin Heidelberg, 293–320
Malcolm, D.G., Roseboom, J.H., Clark, C.E., Fazar, W. (1959): Application of a technique for research and development program evaluation. Operations Research 7, 646–669
Meilijson, I., Nádas, A. (1979): Convex majorization with an application to the length of critical paths. Journal of Applied Probability 16, 671–677
Monhor, D. (1987): An approach to PERT: Application of Dirichlet distribution. Optimization 1, 113–118.
Nádas, A. (1979): Probabilistic PERT. IBM J. Res. Dev. 23, 339–347
Robillard, P., Trahan, M. (1976): Expected completion time in PERT network. Operations Research 24, 177–182
Robillard, P., Trahan, M. (1977): The completion time of PERT network. Operations Research 25, 15–29
Shogan, A.W. (1977): Bounding distributions for a stochastic PERT network. Networks 7, 359–381
Szántai, T. (1988): A computer code for solution of probabilistic constrained stochastic programming problems. In: Ermoliev, Yu., Wets, R. J-B. (Eds.): Numerical Techniques for Stochastic Programming Problems. Springer Series in Computational Mathematics, Springer Verlag, 229–235
Szántai, T. (1997): Probabilistic constrained programming and distributions with given marginals. In: Benes, V., Stepan, J. (Eds.): Distributions with given marginals and moment problems. Proceedings of the 3rd Conference on “Distributions with Given Marginals and Moment Problems”, held at Czech Agricultural University, Prague, Czech Republic, September 2–6, 1996, Kluwer Academic Publishers, Dordrecht Boston London, 205–210
Vanderbei, R.J. (1999): LOQO: An interior point code for quadratic programming. Optimization Methods and Software 12, 451–484
Vanderbei, R.J. (1999): LOQO user’s manual — version 3.10. Optimization Methods and Software 12, 485–514
Wallace, S.W. (1989): Bounding the expected time-cost curve for a stochastic PERT network from below. Operations Research Letters 8, 89–94
Weiss, G. (1986): Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability. Operations Research 34, 595–605
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gouda, A., Monhor, D., Szántai, T. (2006). Stochastic Programming Based PERT Modeling. In: Coping with Uncertainty. Lecture Notes in Economics and Mathematical Systems, vol 581. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-35262-7_14
Download citation
DOI: https://doi.org/10.1007/3-540-35262-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35258-7
Online ISBN: 978-3-540-35262-4
eBook Packages: Business and EconomicsEconomics and Finance (R0)