On-line scheduling to minimize average completion time revisited

Nicole Megow and Andreas S. Schulz

In Operations Research Letters 32, pp. 485-490, 2004.

not available

scheduling, on-line algorithms, approximation algorithms, deterministic, competitive analysis, average completion time

We consider the scheduling problem of minimizing the average weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms.

Download as [PDF] [ps.gz]