Scheduling broadcasts with deadlines

DOI10.1016/j.tcs.2004.02.047zbMath1071.68015OpenAlexW1868304495MaRDI QIDQ1884847

Jae-Hoon Kim, Kyung-Yong Chwa

Publication date: 27 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.047

zbMATH Keywords

On-line algorithmsBroadcast scheduling

Mathematics Subject Classification ID

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

Related Items (12)

Improved on-line broadcast scheduling with deadlines ⋮ Design and analysis of online batching systems ⋮ Competitive analysis of most-request-first for scheduling broadcasts with start-up delay ⋮ MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE ⋮ Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs ⋮ A near optimal scheduler for on-demand data broadcasts ⋮ Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs ⋮ Improved randomized online scheduling of intervals and jobs ⋮ A note on on-line broadcast scheduling with deadlines ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ Online interval scheduling: Randomized and multiprocessor cases ⋮ Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• On-line scheduling of jobs with fixed start and end times
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• Algorithms - ESA 2003

This page was built for publication: Scheduling broadcasts with deadlines