On-line scheduling with tight deadlines.

DOI10.1016/S0304-3975(02)00407-3zbMath1053.68015OpenAlexW1558203020MaRDI QIDQ1401244

Kar-Keung To, Chiu-Yuen Koo, Kunihiko Sadakane, Tak-Wah Lam, Tsuen-Wan Johnny Ngan

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00407-3

zbMATH Keywords

Competitive analysisOn-line algorithmsDeadline scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs ⋮ Online scheduling of jobs with fixed start times on related machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• On the competitiveness of on-line real-time task scheduling
• Speed is as powerful as clairvoyance
• Maximizing job completions online
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Scheduling in the dark

This page was built for publication: On-line scheduling with tight deadlines.