On-Line Scheduling to Minimize Average Completion Time Revisited
Operations Research Letters 32 (2004), 485-490.
Posted: 1 Aug 2007
Abstract
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.
Keywords: Scheduling, Sequencing, Approximation Algorithms, On-line Algorithms, Competitive Ratio
Suggested Citation: Suggested Citation
Megow, Nicole and Schulz, Andreas S., On-Line Scheduling to Minimize Average Completion Time Revisited. Operations Research Letters 32 (2004), 485-490., Available at SSRN: https://ssrn.com/abstract=1003543 or http://dx.doi.org/10.2139/ssrn.460981
Andreas S. Schulz (Contact Author)
Massachusetts Institute of Technology (MIT) - Sloan School of Management ( email )
E53-361
77 Massachusetts Avenue
Cambridge, MA 02139-4307
United States
617-258-7340 (Phone)
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.