On-line scheduling to minimize average completion time revisited.
From MaRDI portal
Publication:703266
DOI10.1016/j.orl.2003.11.008zbMath1054.90037OpenAlexW1964085249WikidataQ57399779 ScholiaQ57399779MaRDI QIDQ703266
Nicole Megow, Andreas S. Schulz
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items
Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time, Online Appointment Scheduling in the Random Order Model, A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time, Online scheduling problems with flexible release dates: applications to infrastructure restoration, Stochastic optimization for real time service capacity allocation under random service demand, An improved greedy algorithm for stochastic online scheduling on unrelated machines, Unnamed Item, Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling, An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time, Coping with Incomplete Information in Scheduling — Stochastic and Online Models, A web-based ERP system for business services and supply chain management: Application to real-world process scheduling, Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time, A \(2.28\)-competitive algorithm for online scheduling on identical machines, On-line scheduling of parallel machines to minimize total completion times, Scheduling of tasks with effectiveness precedence constraints, LP-based online scheduling: From single to parallel machines, Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine, Online scheduling to minimize modified total tardiness with an availability constraint, Randomized selection algorithm for online stochastic unrelated machines scheduling, A Tight 2-Approximation for Preemptive Stochastic Scheduling, Stochastic Online Scheduling Revisited
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
