Markov and Markov-Regenerative pert Networks

V. G. Kulkarni and V. G. Adlakha
Additional contact information
V. G. Kulkarni: University of North Carolina at Chapel Hill, Chapel Hill, North Carolina
V. G. Adlakha: University of Baltimore, Baltimore, Maryland

Operations Research, 1986, vol. 34, issue 5, 769-781

Abstract: This paper investigates pert networks with independent and exponentially distributed activity durations. We model such networks as finite-state, absorbing, continuous-time Markov chains with upper triangular generator matrices. The state space is related to the network structure. We present simple and computationally stable algorithms to evaluate the usual performance criteria: the distribution and moments of project completion time, the probability that a given path is critical, and other related performance measures. In addition, we algorithmically analyze conditional performance measures—for example, project completion time, given a critical path—and present computational results. We then study extensions both to resource-constrained pert networks and to a special class of nonexponential pert networks.

Keywords: 567 Markov processes in PERT networks; 674 PERT with exponential activity durations; 675 resource constraints (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (42)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.5.769 (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:34:y:1986:i:5:p:769-781

Access Statistics for this article

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