SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
The maximum and sum of two beta variables and the analysis of PERT networks
11 references·2 citing·22 second hop
The maximum and sum of two beta variables and the analysis of PERT networks (1985)The maximum and sum of two beta variables…The Completion Time of PERT Networks (1983)The Completion Time of PERT N…Why Projects Are “Always” Late: A Rationale Based on Manual Simulation of a PERT/CPM Network (1981)Why Projects Are “Always” Lat…The Completion Time of PERT Networks (1977)The Completion Time of PERT N…Bounding Distributions for a Stochastic Acyclic Network (1971)Bounding Distributions for a …On the Expected Duration of PERT Type Networks (1967)On the Expected Duration of P…An Analytical Study of the PERT Assumptions (1964)An Analytical Study of the PE…MONTE CARLO METHODS AND THE PERT PROBLEM (1963)MONTE CARLO METHODS AND THE P…Letter to the Editor—Monte Carlo Methods and the PERT Problem (1963)Letter to the Editor—Monte Ca…Letter to the Editor—The PERT Model for the Distribution of an Activity Time (1962)Letter to the Editor—The PERT…Expected Critical Path Lengths in PERT Networks (1962)Expected Critical Path Length…Application of a Technique for Research and Development Program Evaluation (1959)Application of a Technique fo…A study of approximating the moments of the job completion time in PERT networks (1996)A study of approximating the …Evaluating Project Completion Times When Activity Times are Erlang Distributed (1995)Evaluating Project Completion…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)Critical-Path Planning and Scheduling (1959)Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (2000)The use of fuzzy variables in pert (1981)A review of the contribution of Operational Research to Project Management (2002)Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation (2011)PERT 21: Fitting PERT/CPM for use in the 21st century (2011)Resource-constrained project scheduling: Notation, classification, models, and methods (1999)A Simulation-Based Process Model for Managing Complex Design Projects (2005)An upper bound on the expected completion time of PERT networks (1985)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)Critical-path planning and scheduling (1959)Critical-Path Planning and Scheduling: Mathematical Basis (1961)A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem (1984)Project scheduling problem with stochastic activity duration times (2004)Parkinson's Law and Its Implications for Project Management (1991)Using activity sensitivity and network topology information to monitor project time performance (2009)Bounding the Project Completion Time Distribution in PERT Networks (1985)Markov and Markov-Regenerative pert Networks (1986)
this work references cited by second hop

References

  • 1959Application of a Technique for Research and Development Program Evaluation932 cited
  • 1964An Analytical Study of the PERT Assumptions283 cited
  • 1963Letter to the Editor—Monte Carlo Methods and the PERT Problem268 cited
  • 1963MONTE CARLO METHODS AND THE PERT PROBLEM240 cited
  • 1962Letter to the Editor—The PERT Model for the Distribution of an Activity Time189 cited
  • 1962Expected Critical Path Lengths in PERT Networks188 cited
  • 1971Bounding Distributions for a Stochastic Acyclic Network132 cited
  • 1981Why Projects Are “Always” Late: A Rationale Based on Manual Simulation of a PERT/CPM Network119 cited
  • 1967On the Expected Duration of PERT Type Networks100 cited
  • 1983The Completion Time of PERT Networks68 cited
  • 1977The Completion Time of PERT Networks58 cited

Cited by

  • 1996A study of approximating the moments of the job completion time in PERT networks29 cited
  • 1995Evaluating Project Completion Times When Activity Times are Erlang Distributed24 cited

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