Inequalities for the Completion Times of Stochastic PERT Networks

DOI10.1287/moor.4.4.441zbMath0427.90053OpenAlexW2079724820MaRDI QIDQ3863419

Luc P. Devroye

Publication date: 1979

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/872252268a81429d952104ccbb3c56a7a726cd58

zbMATH Keywords

inequalitiesincomplete informationstochastic PERT networksproject planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Risk taking in stochastic PERT networks ⋮ A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing ⋮ A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network ⋮ A classified bibliography of recent research relating to project risk management ⋮ Adjustment of the moments of the project completion times when activity times are exponentially distributed ⋮ The value of side information in network flow optimization ⋮ Evaluating project completion times when activity times are Weibull distributed ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Unnamed Item ⋮ The bias of an estimate of coupled slack in stochastic PERT networks ⋮ An upper bound on the expected completion time of PERT networks ⋮ Estimating the mean completion time of PERT networks with exponentially distributed durations of activities ⋮ Stochastic activity networks with truncated exponential activity times

This page was built for publication: Inequalities for the Completion Times of Stochastic PERT Networks