Bounding distributions for a stochastic pert network

Consider a PERT network with stochastic activity durations. This paper presents a new method for obtaining probability distributions that bound the exact probability distribution of the project duration from above and below. The expected values of these bounding distributions then furnish lower and upper bounds on the expected project duration. As illustrated by computational experience, these bounds are tighter than those obtained from methods currently in use. The paper concludes by describing similar results for stochastic shortest-route networks.

[1]  George B. Kleindorfer,et al.  Bounding Distributions for a Stochastic Acyclic Network , 1971, Oper. Res..

[2]  L. Ringer Numerical Operators for Statistical PERT Critical Path Analysis , 1969 .

[3]  G. Thompson,et al.  Critical Path Analyses Via Chance Constrained and Stochastic Programming , 1964 .

[4]  Richard M. Van Slyke,et al.  Letter to the Editor---Monte Carlo Methods and the PERT Problem , 1963 .

[5]  J. J. Martin Distribution of the Time Through a Directed, Acyclic Network , 1965 .

[6]  John M. Burt,et al.  Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis , 1971 .

[7]  Mark B. Garman More on Conditioned Sampling in the Simulation of Stochastic Networks , 1972 .

[8]  D. Malcolm,et al.  Application of a Technique for Research and Development Program Evaluation , 1959 .

[9]  S. Elmaghraby On the Expected Duration of PERT Type Networks , 1967 .

[10]  D. Walkup,et al.  Association of Random Variables, with Applications , 1967 .

[11]  C. T. Clingen Letter to the Editor-A Modification of Fulkerson's PERT Algorithm , 1964 .

[12]  A. R. Klingel,et al.  Bias in Pert Project Completion Time Calculations for a Real Network , 1966 .

[13]  A. W. Wortham,et al.  A Statistical Theory for PERT Critical Path Analysis , 1966 .

[14]  Pierre N. Robillard,et al.  Technical Note - Expected Completion Time in Pert Networks , 1976, Oper. Res..

[15]  D. R. Fulkerson Expected Critical Path Lengths in PERT Networks , 1962 .

[16]  Larry J. Ringer A Statistical Theory for Pert in Which Completion Times of Activities are Inter-Dependent , 1971 .

[17]  M. Garman.,et al.  Monte Carlo Techniques for Stochastic Pert Network Analysis , 1971 .