A class of on-line scheduling algorithms to minimize total completion time
From MaRDI portal
Publication:1811633
DOI10.1016/S0167-6377(03)00016-6zbMath1013.90067MaRDI QIDQ1811633
Leen Stougie, R. A. Sitters, Xi-wen Lu
Publication date: 17 June 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items (22)
Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine ⋮ Online integrated production-distribution scheduling problems without preemption ⋮ Optimally competitive list batching ⋮ Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ Job scheduling methods for reducing waiting time variance ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Online scheduling of simple linear deteriorating jobs to minimize the total general completion time ⋮ On competitive analysis for polling systems ⋮ An optimal online algorithm for single machine scheduling to minimize total general completion time ⋮ Reducing network and computation complexities in neural based real-time scheduling scheme ⋮ Optimal algorithms for online single machine scheduling with deteriorating jobs ⋮ Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms ⋮ On-line scheduling to minimize average completion time revisited. ⋮ Robust algorithms for total completion time ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ A \(2.28\)-competitive algorithm for online scheduling on identical machines ⋮ On-line scheduling of parallel machines to minimize total completion times ⋮ Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine ⋮ A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time ⋮ Online scheduling to minimize modified total tardiness with an availability constraint ⋮ An optimal online algorithm for single-processor scheduling problem with learning effect
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing mean flow time with release time constraint
- Online algorithms. The state of the art
- Minimizing average completion time in the presence of release dates
- Approximation Techniques for Average Completion Time Scheduling
- Optimal on-line algorithms for single-machine scheduling
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: A class of on-line scheduling algorithms to minimize total completion time
