IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v47y2000i7p559-580.html
   My bibliography  Save this article

Computing bounds on project duration distributions for stochastic PERT networks

Author

Listed:
  • Tetsuo Iida

Abstract

We consider the PERT model with activities whose durations are random variables with known discrete independent distributions. We develop an algorithm to compute lower and upper bounds for the distribution function of the project duration of the stochastic PERT network. The algorithm is based on conditioning on the longest distances to nodes in the network. In addition, we develop an extension of the Kleindorfer's upper bound. We evaluate the method developed in this paper with some numerical examples. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 559–580, 2000

Suggested Citation

  • Tetsuo Iida, 2000. "Computing bounds on project duration distributions for stochastic PERT networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(7), pages 559-580, October.
    • Handle: RePEc:wly:navres:v:47:y:2000:i:7:p:559-580
    DOI: 10.1002/1520-6750(200010)47:73.0.CO;2-9
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(200010)47:73.0.CO;2-9
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(200010)47:73.0.CO;2-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Salah E. Elmaghraby, 1967. "On the Expected Duration of PERT Type Networks," Management Science, INFORMS, vol. 13(5), pages 299-306, January.
    2. Bajis Dodin, 1985. "Bounding the Project Completion Time Distribution in PERT Networks," Operations Research, INFORMS, vol. 33(4), pages 862-881, August.
    3. Larry J. Ringer, 1969. "Numerical Operators for Statistical PERT Critical Path Analysis," Management Science, INFORMS, vol. 16(2), pages 136-143, October.
    4. George B. Kleindorfer, 1971. "Bounding Distributions for a Stochastic Acyclic Network," Operations Research, INFORMS, vol. 19(7), pages 1586-1601, December.
    5. Pierre Robillard & Michel Trahan, 1976. "Technical Note—Expected Completion Time in Pert Networks," Operations Research, INFORMS, vol. 24(1), pages 177-182, February.
    6. Kenneth R. MacCrimmon & Charles A. Ryavec, 1964. "An Analytical Study of the PERT Assumptions," Operations Research, INFORMS, vol. 12(1), pages 16-37, February.
    7. H. O. Hartley & A. W. Wortham, 1966. "A Statistical Theory for PERT Critical Path Analysis," Management Science, INFORMS, vol. 12(10), pages 469-481, June.
    8. C. T. Clingen, 1964. "Letter to the Editor—A Modification of Fulkerson's PERT Algorithm," Operations Research, INFORMS, vol. 12(4), pages 629-632, August.
    9. Pierre Robillard & Michel Trahan, 1977. "The Completion Time of PERT Networks," Operations Research, INFORMS, vol. 25(1), pages 15-29, February.
    10. Larry J. Ringer, 1971. "A Statistical Theory for Pert in Which Completion Times of Activities are Inter-Dependent," Management Science, INFORMS, vol. 17(11), pages 717-723, July.
    11. J. J. Martin, 1965. "Distribution of the Time Through a Directed, Acyclic Network," Operations Research, INFORMS, vol. 13(1), pages 46-66, February.
    12. D. R. Fulkerson, 1962. "Expected Critical Path Lengths in PERT Networks," Operations Research, INFORMS, vol. 10(6), pages 808-817, December.
    13. Luc P. Devroye, 1979. "Inequalities for the Completion Times of Stochastic PERT Networks," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 441-447, November.
    14. John M. Burt, Jr. & Mark B. Garman, 1971. "Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis," Management Science, INFORMS, vol. 18(3), pages 207-217, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fatemi Ghomi, S. M. T. & Hashemin, S. S., 1999. "A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network," European Journal of Operational Research, Elsevier, vol. 114(3), pages 610-625, May.
    2. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    3. Schmidt, Craig W. & Grossmann, Ignacio E., 2000. "The exact overall time distribution of a project with uncertain task durations," European Journal of Operational Research, Elsevier, vol. 126(3), pages 614-636, November.
    4. Lee, Heejung & Suh, Hyo-Won, 2008. "Estimating the duration of stochastic workflow for product development process," International Journal of Production Economics, Elsevier, vol. 111(1), pages 105-117, January.
    5. Fatemi Ghomi, S. M. T. & Rabbani, M., 2003. "A new structural mechanism for reducibility of stochastic PERT networks," European Journal of Operational Research, Elsevier, vol. 145(2), pages 394-402, March.
    6. Sigal, C.E. & Pritsker, A.A.B. & Solberg, J.J., 1979. "The use of cutsets in Monte Carlo analysis of stochastic networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 21(4), pages 376-384.
    7. Gary Mitchell, 2010. "On Calculating Activity Slack in Stochastic Project Networks," American Journal of Economics and Business Administration, Science Publications, vol. 2(1), pages 78-85, March.
    8. Azaron, Amir & Katagiri, Hideki & Sakawa, Masatoshi & Kato, Kosuke & Memariani, Azizollah, 2006. "A multi-objective resource allocation problem in PERT networks," European Journal of Operational Research, Elsevier, vol. 172(3), pages 838-854, August.
    9. Xuan Vinh Doan & Karthik Natarajan, 2012. "On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems," Operations Research, INFORMS, vol. 60(1), pages 138-149, February.
    10. Yousry Abdelkader, 2010. "Adjustment of the moments of the project completion times when activity times are exponentially distributed," Annals of Operations Research, Springer, vol. 181(1), pages 503-514, December.
    11. Azaron, Amir & Fatemi Ghomi, S.M.T., 2008. "Lower bound for the mean project completion time in dynamic PERT networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 120-127, April.
    12. Azaron, Amir & Fynes, Brian & Modarres, Mohammad, 2011. "Due date assignment in repetitive projects," International Journal of Production Economics, Elsevier, vol. 129(1), pages 79-85, January.
    13. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Longest path analysis in networks of queues: Dynamic scheduling problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 132-149, October.
    14. Banerjee, Arunava & Paul, Anand, 2008. "On path correlation and PERT bias," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1208-1216, September.
    15. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
    16. Stephen P. Boyd & Seung-Jean Kim & Dinesh D. Patil & Mark A. Horowitz, 2005. "Digital Circuit Optimization via Geometric Programming," Operations Research, INFORMS, vol. 53(6), pages 899-932, December.
    17. Badinelli, Ralph D., 1996. "Approximating probability density functions and their convolutions using orthogonal polynomials," European Journal of Operational Research, Elsevier, vol. 95(1), pages 211-230, November.
    18. Williams, Terry, 1999. "Towards realism in network simulation," Omega, Elsevier, vol. 27(3), pages 305-314, June.
    19. Williams, Terry, 1995. "A classified bibliography of recent research relating to project risk management," European Journal of Operational Research, Elsevier, vol. 85(1), pages 18-38, August.
    20. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:47:y:2000:i:7:p:559-580. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.