Improved On-Line Broadcast Scheduling with Deadlines

DOI10.1007/11809678_34zbMath1162.68386OpenAlexW1506292197MaRDI QIDQ3591311

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

Publication date: 10 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11809678_34

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

On-line production order scheduling with preemption penalties ⋮ Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting ⋮ An Optimal Strategy for Online Non-uniform Length Order Scheduling ⋮ MYOPIC POLICIES FOR NON-PREEMPTIVE SCHEDULING OF JOBS WITH DECAYING VALUE ⋮ Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs ⋮ Lower bounds on online deadline scheduling with preemption penalties ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ On Job Scheduling with Preemption Penalties ⋮ Online interval scheduling: Randomized and multiprocessor cases

This page was built for publication: Improved On-Line Broadcast Scheduling with Deadlines