A note on on-line broadcast scheduling with deadlines

Authors:
Xin Han;He Guo;Dawei Yin;Yong Zhang
Affiliations:
Department of Computer Science, The University of Hong Kong, Hong Kong;School of Software, Dalian University of Technology, China;Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong
Venue:
Information Processing Letters
Year:
2009

Citing 11
Cited 0

On-line scheduling of jobs with fixed start and end times

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Minimizing maximum response time in scheduling broadcasts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling in the dark

Theoretical Computer Science - Selected papers in honor of Manuel Blum
Scheduling broadcasts with deadlines

Theoretical Computer Science - Special papers from: COCOON 2003
Approximating the average response time in broadcast scheduling

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A maiden analysis of longest wait first

ACM Transactions on Algorithms (TALG)
Improved approximation algorithms for broadcast scheduling

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pull-based data broadcast with dependencies: be fair to users, not to items

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Broadcast scheduling: algorithms and complexity

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved on-line broadcast scheduling with deadlines

Journal of Scheduling
Laxity helps in broadcast scheduling

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we study an on-line broadcast scheduling problem with deadlines, in which the requests asking for the same page can be satisfied simultaneously by broadcasting this page, and every request is associated with a release time, deadline and a required page with a unit size. The objective is to maximize the number of requests satisfied by the schedule. In this paper, we focus on an important special case where all the requests have their spans (the difference between release time and deadline) less than 2. We give an optimal online algorithm, i.e., its competitive ratio matches the lower bound of the problem.