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

Technical Note—Expected Completion Time in Pert Networks

Author

Listed:
  • Pierre Robillard

    ((Posthumous) Université de Montréal, Montréal, Québec)

  • Michel Trahan

    (Canadian Transport Commission, Ottawa, Ontario)

Abstract

This note introduces a general approach to obtain lower bounds for the expected completion time in PERT networks where activity durations are random (discrete or continuous) variables. We show that some well-known bounds can be derived as particular cases of this general approach based on Jensen's inequality. We assume that the durations of the activities terminating at a node are independent of the durations of the activities terminating at another node and that all the activity durations have a finite positive range.

Suggested Citation

  • Pierre Robillard & Michel Trahan, 1976. "Technical Note—Expected Completion Time in Pert Networks," Operations Research, INFORMS, vol. 24(1), pages 177-182, February.
    • Handle: RePEc:inm:oropre:v:24:y:1976:i:1:p:177-182
    DOI: 10.1287/opre.24.1.177
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.24.1.177
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.24.1.177?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. Asadabadi, Mehdi Rajabi & Zwikael, Ofer, 2021. "Integrating risk into estimations of project activities' time and cost: A stratified approach," European Journal of Operational Research, Elsevier, vol. 291(2), pages 482-490.
    2. 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.
    3. 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.
    4. Amir Azaron & Hideki Katagiri & Masatoshi Sakawa, 2007. "Time-cost trade-off via optimal control theory in Markov PERT networks," Annals of Operations Research, Springer, vol. 150(1), pages 47-64, March.

    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:24:y:1976:i:1:p:177-182. 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.