Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Santa Claus Schedules Jobs on Unrelated Machines
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
2011 (English)In: 43rd ACM Symposium on Theory of Computing, STOC'11, 2011, 617-626 p.Conference paper, Published paper (Refereed)
Abstract [en]

One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelated machines, i.e., job j requires time p ij if processed on machine i. More than two decades after its introduction it is still the algorithm of choice even in the restricted model where processing times are of the form pij ∈ pj, ∞. This problem, also known as the restricted assignment problem, is NP-hard to approximate within a factor less than 1.5 which is also the best known lower bound for the general version. Our main result is a polynomial time algorithm that estimates the optimal makespan of the restricted assignment problem within a factor 33/17 + ∈ ∼ 1.9412 + ∈, where ∈ > 0 is an arbitrarily small constant. The result is obtained by upper bounding the integrality gap of a certain strong linear program, known as configuration LP, that was previously successfully used for the related Santa Claus problem. Similar to the strongest analysis for that problem our proof is based on a local search algorithm that will eventually find a schedule of the mentioned approximation guarantee, but is not known to converge in polynomial time.

Place, publisher, year, edition, pages
2011. 617-626 p.
Series
Proceedings of the Annual ACM Symposium on Theory of Computing, ISSN 0737-8017
Keyword [en]
approximation algorithms, linear programming, scheduling
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-81023DOI: 10.1145/1993636.1993718ISI: 000297656800064Scopus ID: 2-s2.0-79959687327ISBN: 978-1-4503-0691-1 (print)OAI: oai:DiVA.org:kth-81023DiVA: diva2:497005
Conference
43rd ACM Symposium on Theory of Computing, STOC'11. San Jose, CA. 6 June 2011 - 8 June 2011
Note

QC 20120213

Available from: 2012-02-10 Created: 2012-02-10 Last updated: 2017-03-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Svensson, Ola
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 25 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf