IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v17y1971i11p717-723.html
   My bibliography  Save this article

A Statistical Theory for Pert in Which Completion Times of Activities are Inter-Dependent

Author

Listed:
  • Larry J. Ringer

    (Texas A & M University)

Abstract

This paper presents a method for taking into account dependency among certain activities in PERT networks. The method presented can be used with the reduction algorithm presented by Hartley and Wortham [Hartley, H. O., Wortham, A. W., A statistical theory for PERT critical path analysis. Management Science, Vol. 12 No. 10 (June 1966), pp. B469-B481.]. The addition of dependency among the completion times for certain types of activities should be a valuable aid in sensitivity analyses of PERT networks.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ormnsc:v:17:y:1971:i:11:p:717-723
    DOI: 10.1287/mnsc.17.11.717
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.17.11.717
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.17.11.717?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. 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. 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.
    3. Banerjee, Arunava & Paul, Anand, 2008. "On path correlation and PERT bias," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1208-1216, September.
    4. 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.

    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:ormnsc:v:17:y:1971:i:11:p:717-723. 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.