Coping with Incomplete Information in Scheduling — Stochastic and Online Models
From MaRDI portal
Publication:5391870
DOI10.1007/978-3-540-77903-2_3zbMath1209.90180MaRDI QIDQ5391870
Publication date: 7 April 2011
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_3
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work
- Unnamed Item
- On-line scheduling to minimize average completion time revisited.
- Approximation Techniques for Average Completion Time Scheduling
- Approximation in stochastic scheduling
- Scheduling for Minimum Total Loss Using Service Time Distributions
- Stochastic scheduling problems I — General strategies
- Beyond Competitive Analysis
- On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
- Stochastic Machine Scheduling with Precedence Constraints
- Models and Algorithms for Stochastic Online Scheduling
- Approximation in Preemptive Stochastic Online Scheduling
- Approximation and Online Algorithms