Competitive Online Scheduling with Level of Service

d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus our problem embodies a notion of “Level of Service” that is increasingly important in multimedia applications. We give two schedulers FirstFit and EndFit based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both FirstFit and EndFit are 2-competitive, and any greedy scheduler is 3-competitive. These bounds are shown to be tight.

• Type: Conference
• Year: 2001
• Where: COCOON
• Authors: Ee-Chien Chang, Chee-Keng Yap
• Keywords: COCOON 2001, Combinatorics, Greedy Scheduler, On-line Scheduling Problem, Thinwire Visualization