Improved lower bounds for online scheduling to minimize total stretch
From MaRDI portal
Publication:1680548
DOI10.1016/J.TCS.2017.09.032zbMath1382.68337OpenAlexW2763417498MaRDI QIDQ1680548
Publication date: 16 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.032
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks
- Minimizing the stretch when scheduling flows of divisible requests
- A lower bound for randomized on-line scheduling algorithms
- On-line scheduling revisited
- Average stretch without migration
- Approximating total flow time on parallel machines
- Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine
- Minimizing the Flow Time Without Migration
- On randomized online scheduling
- Better Bounds for Online Scheduling
- Online Scheduling to Minimize Average Stretch
- Improved Bounds for the Online Scheduling Problem
- Algorithms for minimizing weighted flow time
- Bounds for Certain Multiprocessing Anomalies
This page was built for publication: Improved lower bounds for online scheduling to minimize total stretch
