On-line Scheduling to Minimize Average Completion Time Revisited
Please always quote using this URN:urn:nbn:de:0296-matheon-153
- 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.
Author: | Nicole Megow, Andreas S. Schulz |
---|---|
URN: | urn:nbn:de:0296-matheon-153 |
Referee: | Rolf H. Möhring |
Document Type: | Preprint, Research Center Matheon |
Language: | English |
Date of first Publication: | 2003/12/15 |
Release Date: | 2003/12/15 |
Institute: | Technische Universität Berlin |
Preprint Number: | 10 |