Off-line algorithms for minimizing total flow time in broadcast scheduling

DOI10.1007/11533719_33MaRDI QIDQ5716949zbMATH OpenOpenAlexFDO

Authors Wun-Tat Chan, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong, Francis Y. L. Chin, Hong Zhu

Publication date 11 January 2006

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

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

Mathematics Subject Classification ID

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

Recommendations

• A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
• Improved Approximation Algorithms for Broadcast Scheduling
• Algorithms for minimizing response time in broadcast scheduling
• Algorithms for minimizing response time in broadcast scheduling
• On Broadcast Scheduling with Limited Energy

Cited in

(6)

• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
• An online scalable algorithm for average flow time in broadcast scheduling
• On Broadcast Scheduling with Limited Energy
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
• An online scalable algorithm for average flow time in broadcast scheduling

This page was built for publication: Off-line algorithms for minimizing total flow time in broadcast scheduling

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