SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Normally Distributed Activity Durations in PERT Networks
5 references·3 citing·20 second hop
Normally Distributed Activity Durations in PERT Networks (1985)Normally Distributed Activity Durations i…An upper bound on the expected completion time of PERT networks (1985)An upper bound on the expecte…The Completion Time of PERT Networks (1983)The Completion Time of PERT N…Bounding Distributions for a Stochastic Acyclic Network (1971)Bounding Distributions for a …Simulation with GASP-II (1969)Simulation with GASP-IIExpected Critical Path Lengths in PERT Networks (1962)Expected Critical Path Length…A study of approximating the moments of the job completion time in PERT networks (1996)A study of approximating the …Simple normal approximation to the completion time distribution for a PERT network (1995)Simple normal approximation t…The Most Critical Path in a PERT Network (1994)The Most Critical Path in a P…Bounding the Project Completion Time Distribution in PERT Networks (1985)Application of a Technique for Research and Development Program Evaluation (1959)Activity networks: Project planning and control by network models (1977)THE ESTIMATION OF SOME NETWORK PARAMETERS IN THE PERT MODEL OF ACTIVITY NETWORKS: REVIEW AND CRITIQUE (1989)Evaluating project completion times when activity times are Weibull distributed (2003)How Robust Is Your Project? From Local Failures to Global Catastrophes: A Complex Networks Approach to Project Systemic Risk (2015)An Analytical Study of the PERT Assumptions (1964)Resource-constrained project scheduling: Notation, classification, models, and methods (1999)Letter to the Editor—Monte Carlo Methods and the PERT Problem (1963)RPERT: Repetitive-Projects Evaluation and Review Technique (2013)MONTE CARLO METHODS AND THE PERT PROBLEM (1963)Distribution of the Time Through a Directed, Acyclic Network (1965)Bounding distributions for a stochastic pert network (1977)On criticality and sensitivity in activity networks (2000)Improved event-scanning mechanisms for discrete event simulation (1975)The Completion Time of PERT Networks (1977)Hashed and hierarchical timing wheels: data structures for the efficient implementation of a timer facility (1987)Critical path in an activity network with time constraints (1997)A new approximation algorithm for obtaining the probability distribution function for project completion time (2007)Markov and Markov-Regenerative pert Networks (1986)
this work references cited by second hop

References

  • 1962Expected Critical Path Lengths in PERT Networks188 cited
  • 1971Bounding Distributions for a Stochastic Acyclic Network132 cited
  • 1983The Completion Time of PERT Networks68 cited
  • 1969Simulation with GASP-II64 cited
  • 1985An upper bound on the expected completion time of PERT networks48 cited

Cited by

  • 1994The Most Critical Path in a PERT Network33 cited
  • 1996A study of approximating the moments of the job completion time in PERT networks29 cited
  • 1995Simple normal approximation to the completion time distribution for a PERT network24 cited

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