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

Larry J. Ringer
Additional contact information
Larry J. Ringer: Texas A & M University

Management Science, 1971, vol. 17, issue 11, 717-723

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.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.11.717 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:17:y:1971:i:11:p:717-723

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().