Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A new approximation algorithm for obtaining the probability distribution function for project completion time

16 references·1 citing·26 second hop

FromToDepth

this work references cited by second hop

References

2011Introduction to Stochastic Programming6,469 cited
1998Introduction to Stochastic Programming1,664 cited
1997PSPLIB - A project scheduling problem library1,309 cited
1959Application of a Technique for Research and Development Program Evaluation932 cited
1977Activity networks: Project planning and control by network models575 cited
1963Letter to the Editor—Monte Carlo Methods and the PERT Problem268 cited
1963MONTE CARLO METHODS AND THE PERT PROBLEM240 cited
1965Distribution of the Time Through a Directed, Acyclic Network221 cited
1989Advances in Project Scheduling196 cited
1986Markov and Markov-Regenerative pert Networks184 cited
1988Computational complexity of PERT problems169 cited
1971Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis153 cited
1989A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987119 cited
1979The use of cutsets in Monte Carlo analysis of stochastic networks95 cited
1983The Completion Time of PERT Networks68 cited
2000Project duration in stochastic networks by the PERT-path technique

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

67 cited

Cited by

2014The Effects of Different Activity Distributions on Project Duration in PERT Networks46 cited