Bounding the expected time-cost curve for a stochastic PERT network from below

DOI10.1016/0167-6377(89)90007-2zbMath0674.90073OpenAlexW2053150849MaRDI QIDQ1121790

Stein W. Wallace

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90007-2

zbMATH Keywords

lower boundexpected time-cost curverandom PERT network

Mathematics Subject Classification ID

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

Related Items

A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, Sample-path optimization of convex stochastic performance functions, A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations, Improving project cost estimation by taking into account managerial flexibility

Cites Work

• Unnamed Item
• Critical path planning under uncertainty
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• Solving stochastic programs with network recourse
• Bounding distributions for a stochastic pert network
• Expected Critical Path Lengths in PERT Networks
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• Bounding Distributions for a Stochastic Acyclic Network