Bounding Distributions for a Stochastic Acyclic Network

George B. Kleindorfer
Additional contact information
George B. Kleindorfer: University of California, Berkeley, California

Operations Research, 1971, vol. 19, issue 7, 1586-1601

Abstract: Where the durations of the activities in an acyclic scheduling network are random variables, this paper obtains upper and lower bounding distributions for the activity starting- and finishing-time probability distributions, as well as upper and lower bounds for the expected starting and finishing time of each network activity, and for expected network resource flows. The tightness of the bounds for various networks is examined, and a computational experience with the methods is reported.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.7.1586 (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:19:y:1971:i:7:p:1586-1601

Access Statistics for this article

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