An approximate solution to the PERT problem

DOI10.1016/0898-1221(91)90046-7zbMath0714.90041OpenAlexW1993455779MaRDI QIDQ751484

Y. W. Shum, Domenic Sculli

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90046-7

zbMATH Keywords

PERT networkcompletion timesmean and standard deviation

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Normally Distributed Activity Durations in PERT Networks
• A Multivariate Approach to Estimating the Completion Time for PERT Networks
• The Completion Time of PERT Networks
• The Completion Time of PERT Networks
• Bounding Distributions for Stochastic Logic Networks
• Expected Critical Path Lengths in PERT Networks
• On the Expected Duration of PERT Type Networks
• The Greatest of a Finite Set of Random Variables
• Bounding Distributions for a Stochastic Acyclic Network

This page was built for publication: An approximate solution to the PERT problem