A note on on-line broadcast scheduling with deadlines

A note on on-line broadcast scheduling with deadlines

Article history: Received 19 March 2008 Received in revised form 4 July 2008 Communicated by C. Scheideler

Improved On-Line Broadcast Scheduling with Deadlines

We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the satisfied requests. For the case where all requested pages have the same length, we present an online deterministic algorithm named BAR and prove that it is 4.56-competitive. This improves the previous algorithm of Ki...

On-Line Scheduling with Tight Deadlines

On - line Scheduling with Hard Deadlines ( Extended

We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline , or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be sta...

On-demand Bounded Broadcast Scheduling with Tight Deadlines

We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast. The HEU algorithm of Woeginger (1994) is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadl...