ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
From MaRDI portal
Publication:5462125
DOI10.1142/S0129054105003170zbMath1097.68021MaRDI QIDQ5462125
Hong Shen, Francis Y. L. Chin, Stanley P. Y. Fung
Publication date: 1 August 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work
- 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?
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems