Chance-constrained programming in activity networks: A critical evaluation

European Journal of Operational Research

Volumn 131, Issue 2, 2001, Pages 440-458

  Elmaghraby, Salah E ^a   Soewandi, Hanijanto ^b   Yao, Ming Jong ^c  

^a North Carolina State University   (United States)

^b Microstrategy Incorporation   (United States)

^c TUNGHAI UNIVERSITY   (Taiwan)

Author keywords

Activity networks; Chance constrained programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; STOCHASTIC PROGRAMMING;

ACTIVITY NETWORKS; BACKTRACKING METHODS; CHANCE-CONSTRAINED PROGRAMMING MODELS;

OPERATIONS RESEARCH;

EID: 0035372223     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00086-2     Document Type: Article

References (16)

1. A network interpretation and a direct sub-dual algorithm for critical path scheduling
2. Deterministic equivalents for optimizing and satisficing under chance constraints
3. Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil
4. Critical path analysis via chance constrained and stochastic programming
5. Constrained generalized medians and hypermedians as deterministic equivalents for two-stage linear programs under uncertainty
6. The estimation of some network parameters in the PERT model of activity networks: Review and critique
7. Computational complexity of PERT problems
8. An upper bound on the expected completion time of PERT networks
9. The chance constrained critical path with location-scale distributions
10. Application of a technique for research and development program evaluation
11. The use of cutsets in Monte Carlo analysis of stochastic networks
12. Monte Carlo methods and the PERT problem