Improved on-line broadcast scheduling with deadlines

DOI10.1007/s10951-007-0036-6zbMath1168.90438OpenAlexW1963631805MaRDI QIDQ835602

Wun-Tat Chan, Chung Keung Poon, Prudence W. H. Wong, Stanley P. Y. Fung, Feifeng Zheng, Francis Y. L. Chin

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0036-6

zbMATH Keywords

competitive analysisonline algorithmsbroadcast scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Online scheduling with preemption or non-completion penalties ⋮ Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs ⋮ Improved randomized online scheduling of intervals and jobs ⋮ A note on on-line broadcast scheduling with deadlines ⋮ Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs

Cites Work

• A tight lower bound for job scheduling with cancellation
• On-line scheduling of jobs with fixed start and end times
• Algorithms for minimizing response time in broadcast scheduling
• Scheduling broadcasts with deadlines
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• Computing and Combinatorics
• Algorithms - ESA 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved on-line broadcast scheduling with deadlines