The Completion Time of PERT Networks

Pierre Robillard and Michel Trahan
Additional contact information
Pierre Robillard: (Posthumous) University of Montreal, Montreal, Quebec
Michel Trahan: Department of Health and Welfare, Ottawa, Ontario

Operations Research, 1977, vol. 25, issue 1, 15-29

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.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.1.15 (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:oropre:v:25:y:1977:i:1:p:15-29

Access Statistics for this article

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