Advertisement

An optimal algorithm for preemptive on-line scheduling

  • Bo Chen
  • André van Vliet
  • Gerhard J. Woeginger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 855)

Abstract

We investigate the problem of on-line scheduling jobs on m identical parallel machines where preemption is allowed. The goal is to minimize the makespan. We derive an approximation algorithm with worst case guarantee m m /(m m −(m−1) m ) for every m≥2, which increasingly tends to e/(e−1)≈1.58 as m→∞. Moreover, we prove that for no m≥2 there does exist any approximation algorithm with a better worst case guarantee.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. Proc. 24th ACM Symposium on Theory of Computing (1992) 51–58Google Scholar
  2. 2.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979)Google Scholar
  3. 3.
    McNaughton, R.: Scheduling with deadlines and loss functions, Management Sci. 6 (1959) 1–12zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Bo Chen
    • 1
  • André van Vliet
    • 1
  • Gerhard J. Woeginger
    • 2
  1. 1.Econometric InstituteErasmus University RotterdamDR RotterdamThe Netherlands
  2. 2.Institut für MathematikTU GrazGrazAustria

Personalised recommendations