IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v25y1977i1p15-29.html
   My bibliography  Save this article

The Completion Time of PERT Networks

Author

Listed:
  • Pierre Robillard

    ((Posthumous) University of Montreal, Montreal, Quebec)

  • Michel Trahan

    (Department of Health and Welfare, Ottawa, Ontario)

Abstract

PERT and critical path techniques have exceptionally wide applications. These techniques and their applications have contributed significantly to better planning, control, and general organization of many programs. This paper is concerned with a technical improvement in PERT methodology by introducing a new approach to approximating, in a computationally efficient way, the total duration distribution function of a program. It is assumed that the activity durations are independent random variables and have a finite range. The first part of the paper considers PERT networks and deals with the lower bound approximation to the total duration distribution function of the program. Then we use this approximation and CPM to propose bounds for the different moments of the distribution function. We illustrate this with numerical examples. In the second part of the paper we adapt our results to PERT decision networks.

Suggested Citation

  • Pierre Robillard & Michel Trahan, 1977. "The Completion Time of PERT Networks," Operations Research, INFORMS, vol. 25(1), pages 15-29, February.
    • Handle: RePEc:inm:oropre:v:25:y:1977:i:1:p:15-29
    DOI: 10.1287/opre.25.1.15
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.1.15
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.25.1.15?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yang, Hsu-Hao & Chen, Yen-Liang, 2000. "Finding the critical path in an activity network with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 120(3), pages 603-613, February.
    2. 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.
    3. 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.
    4. 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.
    5. Chen, Yen-Liang & Rinks, Dan & Tang, Kwei, 1997. "Critical path in an activity network with time constraints," European Journal of Operational Research, Elsevier, vol. 100(1), pages 122-133, July.

    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:inm:oropre:v:25:y:1977:i:1:p:15-29. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.