Semi-clairvoyant scheduling
From MaRDI portal
Publication:1887092
DOI10.1016/j.tcs.2004.05.023zbMath1073.68017OpenAlexW1972396058MaRDI QIDQ1887092
Luca Becchetti, Alberto Marchetti-Spaccamela, Stefano Leonardi, Kirk R. Pruhs
Publication date: 23 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.023
Related Items (2)
SEH: size estimate hedging for single-server queues ⋮ Energy-efficient multiprocessor scheduling for flow time and makespan
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonclairvoyant scheduling
- Minimizing flow time nonclairvoyantly
- Speed is as powerful as clairvoyance
- Online Scheduling to Minimize Average Stretch
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines
- Scheduling in the dark
This page was built for publication: Semi-clairvoyant scheduling
