When greediness fails: examples from stochastic scheduling.
From MaRDI portal
Publication:1412702
DOI10.1016/S0167-6377(03)00047-6zbMath1052.90039MaRDI QIDQ1412702
Publication date: 25 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items (4)
Unrelated Machine Scheduling with Stochastic Processing Times ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
Cites Work
- Unnamed Item
- Unnamed Item
- Stochastic scheduling problems I — General strategies
- Stochastic scheduling problems II-set strategies-
- On the optimality of static priority policies in stochastic scheduling on parallel machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Expected Critical Path Lengths in PERT Networks
- A Statistical Theory for PERT Critical Path Analysis
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Scheduling with Random Service Times
This page was built for publication: When greediness fails: examples from stochastic scheduling.