Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Inequalities for the Completion Times of Stochastic PERT Networks

6 references·9 citing·31 second hop

FromToDepth

this work references cited by second hop

References

1964An Analytical Study of the PERT Assumptions283 cited
1962Expected Critical Path Lengths in PERT Networks188 cited
1971Bounding Distributions for a Stochastic Acyclic Network132 cited
1964Critical Path Analyses Via Chance Constrained and Stochastic Programming117 cited
1967On the Expected Duration of PERT Type Networks100 cited
1966A Statistical Theory for PERT Critical Path Analysis92 cited

Cited by

1999Resource-constrained project scheduling: Notation, classification, models, and methods1,501 cited
1985An upper bound on the expected completion time of PERT networks48 cited
1986A Multivariate Approach to Estimating the Completion Time for PERT Networks45 cited
2003Evaluating project completion times when activity times are Weibull distributed42 cited
1989THE ESTIMATION OF SOME NETWORK PARAMETERS IN THE PERT MODEL OF ACTIVITY NETWORKS: REVIEW AND CRITIQUE39 cited
1995Bounds on Expected Project Tardiness34 cited
1982The bias of an estimate of coupled slack in stochastic PERT networks33 cited
1993Estimating the mean completion time of PERT networks with exponentially distributed durations of activities31 cited
2007

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing

28 cited