Technical Note—Expected Completion Time in Pert Networks

Pierre Robillard and Michel Trahan
Additional contact information
Pierre Robillard: (Posthumous) Université de Montréal, Montréal, Québec
Michel Trahan: Canadian Transport Commission, Ottawa, Ontario

Operations Research, 1976, vol. 24, issue 1, 177-182

Abstract: This note introduces a general approach to obtain lower bounds for the expected completion time in PERT networks where activity durations are random (discrete or continuous) variables. We show that some well-known bounds can be derived as particular cases of this general approach based on Jensen's inequality. We assume that the durations of the activities terminating at a node are independent of the durations of the activities terminating at another node and that all the activity durations have a finite positive range.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.1.177 (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:24:y:1976:i:1:p:177-182

Access Statistics for this article

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