The Completion Time of PERT Networks

DOI10.2307/2581100zbMath0502.90045OpenAlexW4256666068MaRDI QIDQ3968744

Domenic Sculli

Publication date: 1983

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581100

zbMATH Keywords

approximationPERT networkscompletion time varianceactivity schedulingrandom activity durationscompletion time mean

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Probabilistic methods, stochastic differential equations (65C99)

Related Items (16)

Risk taking in stochastic PERT networks ⋮ Adjustment of the moments of the project completion times when activity times are exponentially distributed ⋮ A new probabilistic approach to the path criticality in stochastic PERT ⋮ A new approximation algorithm for obtaining the probability distribution function for project completion time ⋮ Solution of interval PERT/CPM network problems by a simplified tabular method ⋮ Evaluating the project completion time when activity networks follow beta distribution ⋮ Distribution of the Activity Time in Network Analysis: A Critical Revisit with a Gamma Alternative ⋮ Stochastic networks and the extreme value distribution ⋮ An approximate solution to the PERT problem ⋮ Critical path in an activity network with time constraints ⋮ Approximating probability density functions and their convolutions using orthogonal polynomials ⋮ Unnamed Item ⋮ Finding the critical path in an activity network with time-switch constraints ⋮ Improving project cost estimation by taking into account managerial flexibility ⋮ An upper bound on the expected completion time of PERT networks ⋮ A new structural mechanism for reducibility of stochastic PERT networks

This page was built for publication: The Completion Time of PERT Networks