Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds

  • Michael Etscheid
Conference paper

DOI: 10.1007/978-3-642-45030-3_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8283)
Cite this paper as:
Etscheid M. (2013) Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds. In: Cai L., Cheng SW., Lam TW. (eds) Algorithms and Computation. ISAAC 2013. Lecture Notes in Computer Science, vol 8283. Springer, Berlin, Heidelberg

Abstract

We study two local search and a greedy algorithm for scheduling. The worst-case performance guarantees are well-known but seem to be contrived and too pessimistic for practical applications. For unrestricted machines, Brunsch et al. [3] showed that the worst-case performance guarantees of these algorithms are not robust if the job sizes are subject to random noise. However, in the case of restricted related machines the worst-case bounds turned out to be robust even in the presence of random noise. We show that if the machine speeds rather than the job sizes are perturbed, also the performance guarantees for restricted machines decrease thus yielding a stronger result.

Keywords

smoothed analysis scheduling performance guarantees 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Michael Etscheid
    • 1
  1. 1.Dept. of Computer ScienceUniversity of BonnGermany

Personalised recommendations