Optimal algorithms for online scheduling with bounded rearrangement at the end
DOI10.1016/j.tcs.2011.07.014zbMath1230.68051WikidataQ63353562 ScholiaQ63353562MaRDI QIDQ653317
György Dósa, Attila Benko, Yan Lan, Xin Han, Xin Chen
Publication date: 9 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.014
upper bounds; lower bounds; online scheduling; online scheduling with bounded rearrangement at the end (BRE)
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W27: Online algorithms; streaming algorithms
Related Items
Cites Work
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Online scheduling with rearrangement on two related machines
- Online scheduling with a buffer on related machines
- Online scheduling with reassignment
- Online scheduling on two uniform machines to minimize the makespan
- Semi on-line algorithms for the partition problem
- Online Scheduling with Bounded Migration
- The Power of Reordering for Online Minimum Makespan Scheduling
- `` Strong NP-Completeness Results
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive Online Scheduling with Reordering