When greediness fails: examples from stochastic scheduling.

DOI10.1016/S0167-6377(03)00047-6MaRDI QIDQ1412702zbMATH OpenFDO

Authors Marc Uetz

Publication date 25 November 2003

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

zbMATH Keywords

Deliberate idlenessScheduling policyStochastic machine scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Stochastic scheduling problems I — General strategies
• Greed works -- online algorithms for unrelated machine stochastic scheduling
• scientific article; zbMATH DE number 96059
• scientific article; zbMATH DE number 3906216
• Optimal stochastic scheduling

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3894816 (Why is no real title available?)
• A Statistical Theory for PERT Critical Path Analysis
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Expected Critical Path Lengths in PERT Networks
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling with Random Service Times
• Stochastic scheduling problems I — General strategies
• Stochastic scheduling problems II-set strategies-

Cited in

(5)

• Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
• Approximations to stochastic dynamic programs via information relaxation duality
• Greed works -- online algorithms for unrelated machine stochastic scheduling
• Greed in resource scheduling
• Unrelated machine scheduling with stochastic processing times

This page was built for publication: When greediness fails: examples from stochastic scheduling.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1412702)