ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES

DOI10.1142/S012905410700467XzbMath1112.68016OpenAlexW2008710327MaRDI QIDQ3434275

Chung Keung Poon, Feifeng Zheng, Yin-Feng Xu

Publication date: 25 April 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410700467x

zbMATH Keywords

online scheduling problem

Mathematics Subject Classification ID

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

Related Items (1)

Online scheduling with immediate and reliable lead-time quotation

Cites Work

• On-line scheduling of jobs with fixed start and end times
• An improved randomized on-line algorithm for a weighted interval selection problem

This page was built for publication: ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES