On-line scheduling to minimize average completion time revisited.
DOI10.1016/J.ORL.2003.11.008zbMATH Open1054.90037OpenAlexW1964085249WikidataQ57399779 ScholiaQ57399779MaRDI QIDQ703266FDOQ703266
Authors: 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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- A class of on-line scheduling algorithms to minimize total completion time
- Title not available (Why is that?)
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Single machine scheduling with release dates
- Title not available (Why is that?)
- Scheduling Unrelated Machines by Randomized Rounding
- Title not available (Why is that?)
- Minimizing average completion time in the presence of release dates
- Title not available (Why is that?)
- Approximation techniques for average completion time scheduling
- The power of \(\alpha\)-points in preemptive single machine scheduling.
Cited In (27)
- A new average case analysis for completion time scheduling
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- A tight 2-approximation for preemptive stochastic scheduling
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models
- Title not available (Why is that?)
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- A class of on-line scheduling algorithms to minimize total completion time
- Stochastic Online Scheduling Revisited
- A web-based ERP system for business services and supply chain management: Application to real-world process scheduling
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Online scheduling to minimize modified total tardiness with an availability constraint
- A \(2.28\)-competitive algorithm for online scheduling on identical machines
- 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 non-preemptive scheduling to optimize max stretch on a single machine
- A competitive online algorithm for minimizing total weighted completion time on uniform machines
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Scheduling of tasks with effectiveness precedence constraints
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Efficient algorithms for average completion time scheduling
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- Stochastic optimization for real time service capacity allocation under random service demand
- Online appointment scheduling in the random order model
- Approximation and Online Algorithms
This page was built for publication: On-line scheduling to minimize average completion time revisited.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703266)
