Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms

  • Nicole Megow
  • Andreas S. Schulz
Conference paper

DOI: 10.1007/978-3-540-24592-6_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2909)
Cite this paper as:
Megow N., Schulz A.S. (2004) Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. In: Solis-Oba R., Jansen K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg


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 ratio of the currently best randomized on-line algorithm for this scenario. Our nonpreemptive algorithm has a competitive ratio of 3.28. Both results are characterized by a surprisingly simple analysis; moreover, the preemptive algorithm also works in the less clairvoyant environment in which only the ratio of weight to processing time of a job becomes known at its release date, but neither its actual weight nor its processing time. In the corresponding nonpreemptive situation, every on-line algorithm has an unbounded competitive ratio.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Nicole Megow
    • 1
  • Andreas S. Schulz
    • 2
  1. 1.Institut für MathematikTechnische Universität BerlinBerlinGermany
  2. 2.Sloan School of ManagementMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations