Expected Critical Path Lengths in PERT Networks

D. R. Fulkerson
Additional contact information
D. R. Fulkerson: The Rand Corporation, Santa Monica, California

Operations Research, 1962, vol. 10, issue 6, 808-817

Abstract: A method of obtaining a fairly good lower approximation to the expected duration time of a project whose individual job times are discrete random variables is described. It is assumed that jobs that immediately precede any given job may have a joint distribution of times, with independence between immediate predecessors of different jobs. The method provides an estimate that is usually much better, and never worse, than the one obtained by replacing each random job time by its expected value. An application to expected minimal path lengths in networks whose arc lengths are random variables is discussed.

Date: 1962
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.10.6.808 (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:10:y:1962:i:6:p:808-817

Access Statistics for this article

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