An optimal algorithm for preemptive on-line scheduling
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.
Unable to display preview. Download preview PDF.
- 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.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979)Google Scholar