Temporary tasks assignment resolved

Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev

Research output: Contribution to journalArticle

Abstract

Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem existed for almost a decade, see [12]. We resolve this problem by providing an inapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2-inapproximability result for the general case.

Original languageEnglish (US)
Pages (from-to)295-314
Number of pages20
JournalAlgorithmica (New York)
Volume36
Issue number3
DOIs
StatePublished - Jul 2003

Fingerprint

Task Assignment
Resource allocation
Inapproximability
Load Balancing
Resolve
Competitive Ratio
Open Problems
Line

Keywords

  • Competitive
  • Load balancing
  • On-line
  • PTAS
  • Unrelated machines

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Safety, Risk, Reliability and Quality
  • Applied Mathematics

Cite this

Temporary tasks assignment resolved. / Armon, Amitai; Azar, Yossi; Epstein, Leah; Regev, Oded.

In: Algorithmica (New York), Vol. 36, No. 3, 07.2003, p. 295-314.

Research output: Contribution to journalArticle

Armon, Amitai ; Azar, Yossi ; Epstein, Leah ; Regev, Oded. / Temporary tasks assignment resolved. In: Algorithmica (New York). 2003 ; Vol. 36, No. 3. pp. 295-314.
@article{a42bf7815a904654b456bb4a964dc51c,
title = "Temporary tasks assignment resolved",
abstract = "Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem existed for almost a decade, see [12]. We resolve this problem by providing an inapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2-inapproximability result for the general case.",
keywords = "Competitive, Load balancing, On-line, PTAS, Unrelated machines",
author = "Amitai Armon and Yossi Azar and Leah Epstein and Oded Regev",
year = "2003",
month = "7",
doi = "10.1007/s00453-003-1017-6",
language = "English (US)",
volume = "36",
pages = "295--314",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Temporary tasks assignment resolved

AU - Armon, Amitai

AU - Azar, Yossi

AU - Epstein, Leah

AU - Regev, Oded

PY - 2003/7

Y1 - 2003/7

N2 - Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem existed for almost a decade, see [12]. We resolve this problem by providing an inapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2-inapproximability result for the general case.

AB - Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem existed for almost a decade, see [12]. We resolve this problem by providing an inapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2-inapproximability result for the general case.

KW - Competitive

KW - Load balancing

KW - On-line

KW - PTAS

KW - Unrelated machines

UR - http://www.scopus.com/inward/record.url?scp=0942300984&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0942300984&partnerID=8YFLogxK

U2 - 10.1007/s00453-003-1017-6

DO - 10.1007/s00453-003-1017-6

M3 - Article

AN - SCOPUS:0942300984

VL - 36

SP - 295

EP - 314

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 3

ER -