Estimating Critical Path and Arc Probabilities in Stochastic Activity Networks.

摘要

This paper describes a new procedure for estimating parameters of a stochastic activity network of N arcs. The parameters include the probability that path m is the longest path, the probability that path m is the shortest path, the probability that arc i is on the longest path and the probability that arc i is on the shortest path.