On-line scheduling to minimize average completion time revisited

✍ Scribed by Nicole Megow; Andreas S Schulz

• Book ID: 104076243
• Publisher: Elsevier Science
• Year: 2004
• Tongue: English
• Weight: 192 KB
• Volume: 32
• Category: Article
• ISSN: 0167-6377
• DOI: 10.1016/j.orl.2003.11.008

✦ Synopsis

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.