A tight lower bound for job scheduling with cancellation

DOI10.1016/j.ipl.2005.09.001zbMath1184.68142OpenAlexW2160705700MaRDI QIDQ1044744

Stanley P. Y. Fung, Chung Keung Poon, Francis Y. L. Chin, Feifeng Zheng, Yin-Feng Xu

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.09.001

zbMATH Keywords

schedulinglower boundson-line algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Improved on-line broadcast scheduling with deadlines ⋮ A near optimal scheduler for on-demand data broadcasts

Cites Work

• Unnamed Item
• On-line scheduling of jobs with fixed start and end times
• Scheduling Broadcasts with Deadlines
• Computing and Combinatorics

This page was built for publication: A tight lower bound for job scheduling with cancellation