Chance-constrained programming in activity networks: A critical evaluation

DOI10.1016/S0377-2217(00)00086-2zbMath0991.90018WikidataQ126408854 ScholiaQ126408854MaRDI QIDQ5935424

Hanijanto Soewandi, Ming-Jong Yao, Salah E. Elmaghraby

Publication date: 3 September 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

activity networkschance-constrained programming

Mathematics Subject Classification ID

Stochastic programming (90C15) Deterministic network models in operations research (90B10)

Related Items (3)

Chance constraint programming problems with parameters as exponential random variable ⋮ Genetic algorithm based technique for solving chance constrained problems ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem

Cites Work

• Unnamed Item
• Unnamed Item
• The use of cutsets in Monte Carlo analysis of stochastic networks
• The chance constrained critical path with location-scale distributions
• An upper bound on the expected completion time of PERT networks
• Introduction to Stochastic Programming
• Application of a Technique for Research and Development Program Evaluation
• Critical Path Analyses Via Chance Constrained and Stochastic Programming
• Constrained Generalized Medians and Hypermedians as Deterministic Equivalents for Two-Stage Linear Programs under Uncertainty
• Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints

This page was built for publication: Chance-constrained programming in activity networks: A critical evaluation