On-Line Windows Scheduling of Temporary Items

In this paper we study on-line windows scheduling (WS) of temporary items. In a broadcasting system, there are some broadcast channels, each can broadcast one item in one time unit. Upon the arrival of an item with a window w, where w is a positive integer, the item has to be scheduled on a channel such that it will be broadcasted in the channel at least once every w time units until its departure. With the on-line input of these temporary items, the problem is to minimize the maximum number of channels used over all time. We give a 5-competitive on-line algorithm and show that there is a lower bound of 2 − for any > 0 on the competitive ratio of any on-line algorithm.

• Type: Conference
• Year: 2004
• Where: ISAAC
• Authors: Wun-Tat Chan, Prudence W. H. Wong
• Keywords: ISAAC 2004, On-line, Temporary Items, Time Units