Improved competitive algorithms for online scheduling with partial job values
From MaRDI portal
Publication:1884846
DOI10.1016/j.tcs.2004.02.046zbMath1071.68013OpenAlexW1553311347MaRDI QIDQ1884846
Francis Y. L. Chin, Stanley P. Y. Fung
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.046
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the competitiveness of on-line real-time task scheduling
- Preemptive scheduling in overloaded systems.
- Online scheduling with partial job values: does timesharing or randomization help?
- Speed is as powerful as clairvoyance
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems