Determining the K Most Critical Paths in PERT Networks

Bajis Dodin
Additional contact information
Bajis Dodin: University of Wisconsin, Milwaukee, Wisconsin

Operations Research, 1984, vol. 32, issue 4, 859-877

Abstract: A fundamental problem in PERT networks is to identify a project's critical paths and its critical activities. In this paper we define the criticality index of a path as the probability that the duration of the path is greater than or equal to the duration of every other path in the network and define the criticality index of an activity as the sum of the criticality indices of the paths containing that activity. The most critical path or K most critical paths in a PERT network could be found by enumerating all the paths and calculating the corresponding criticality indices, both of which are burdensome tasks. This paper uses stochastic dominance to develop a procedure to identify the K most critical paths without using this path enumeration. The procedure has been applied to various sized PERT networks generated at random, and the results are found to be very close to those obtained by extensive Monte Carlo sampling.

Keywords: 671 project management and control; 674 PERT networks (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.4.859 (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:32:y:1984:i:4:p:859-877

Access Statistics for this article

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