Bounding the distribution of project duration in PERT networks

DOI10.1016/0167-6377(92)90017-WzbMath0766.90042MaRDI QIDQ1200756

Jerzy Kamburowski

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

PERT networksproject durationstochastic convex orderingstochastic duration times

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Computing the throughput of probabilistic and replicated streaming applications ⋮ On the distribution-free newsboy problem with some non-skewed demands

Cites Work

• Unnamed Item
• Computing the probability distribution of project duration in a PERT network
• Comparisons of certain distribution functions
• Bounding the Project Completion Time Distribution in PERT Networks
• A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs

This page was built for publication: Bounding the distribution of project duration in PERT networks