Improved on-line broadcast scheduling with deadlines

DOI10.1007/S10951-007-0036-6MaRDI QIDQ835602zbMATH OpenOpenAlexFDO

Authors Stanley P. Y. Fung, Feifeng Zheng, Wun-Tat Chan, Chung Keung Poon, Prudence W. H. Wong, 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

online algorithmscompetitive analysisbroadcast scheduling

Mathematics Subject Classification ID

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

Recommendations

• Improved On-Line Broadcast Scheduling with Deadlines
• A note on on-line broadcast scheduling with deadlines
• Algorithms - ESA 2003
• Better Scalable Algorithms for Broadcast Scheduling
• ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES

Cites work

• scientific article; zbMATH DE number 1670667 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2119692 (Why is no real title available?)
• scientific article; zbMATH DE number 1445348 (Why is no real title available?)
• A tight lower bound for job scheduling with cancellation
• Algorithms - ESA 2003
• Algorithms for minimizing response time in broadcast scheduling
• Computing and Combinatorics
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• On-line scheduling of jobs with fixed start and end times
• Scheduling broadcasts with deadlines

Cited in

(12)

• Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
• Computing and Combinatorics
• Scheduling broadcasts with deadlines
• A note on on-line broadcast scheduling with deadlines
• Improved On-Line Broadcast Scheduling with Deadlines
• Online scheduling with preemption or non-completion penalties
• ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
• 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 near optimal scheduler for on-demand data broadcasts
• Algorithms - ESA 2003
• Theoretical Computer Science

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835602)