On-line scheduling to minimize average completion time revisited.
From MaRDI portal
Publication:703266
DOI10.1016/j.orl.2003.11.008zbMath1054.90037WikidataQ57399779 ScholiaQ57399779MaRDI QIDQ703266
Andreas S. Schulz, Nicole Megow
Publication date: 11 January 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2003.11.008
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68W25: Approximation algorithms
Related Items
Coping with Incomplete Information in Scheduling — Stochastic and Online Models, Stochastic Online Scheduling Revisited, Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time, On-line scheduling of parallel machines to minimize total completion times, LP-based online scheduling: From single to parallel machines, Online scheduling to minimize modified total tardiness with an availability constraint, A web-based ERP system for business services and supply chain management: Application to real-world process scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing average completion time in the presence of release dates
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- A class of on-line scheduling algorithms to minimize total completion time
- Approximation Techniques for Average Completion Time Scheduling
- Single Machine Scheduling with Release Dates
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling Unrelated Machines by Randomized Rounding
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
