Improved on-line broadcast scheduling with deadlines

DOI10.1007/S10951-007-0036-6zbMATH Open1168.90438OpenAlexW1963631805MaRDI QIDQ835602FDOQ835602

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

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

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)

Cites Work

• Title not available (Why is that?)
• On-line scheduling of jobs with fixed start and end times
• Scheduling broadcasts with deadlines
• Computing and Combinatorics
• Algorithms - ESA 2003
• Title not available (Why is that?)
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• Title not available (Why is that?)
• A tight lower bound for job scheduling with cancellation
• Algorithms for minimizing response time in broadcast scheduling
• Title not available (Why is that?)

Cited In (12)

• A note on on-line broadcast scheduling with deadlines
• Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
• Improved On-Line Broadcast Scheduling with Deadlines
• Computing and Combinatorics
• Improved randomized online scheduling of intervals and jobs
• Online scheduling with preemption or non-completion penalties
• Algorithms - ESA 2003
• ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
• Theoretical Computer Science
• Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
• A near optimal scheduler for on-demand data broadcasts
• Scheduling broadcasts with deadlines

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)