A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms
[chapter]
2004
Lecture Notes in Computer Science
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 compared to the previously best-known deterministic on-line algorithms, which are (4 + ε)-competitive in either case. Our preemptive algorithm is 2-competitive, which actually meets the competitive
doi:10.1007/978-3-540-24592-6_18
fatcat:hhlegkizpfbslj6jyu5zdri23y