Bounding Distributions for a Stochastic Acyclic Network

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.