Off-line temporary tasks assignment

Yossi Azar, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we consider the temporary tasks assignment problem. In this problem, there are m parallel machines and n independent jobs. Each job has an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to find an assignment that minimizes the maximum load over machines and time. We present a polynomial time approximation scheme for the case in which the number of machines is fixed. We also show that for the case in which the number of machines is given as part of the input (i.e., not fixed), no algorithm can achieve a better approximation ratio than4/3 unless P = NP.

Original languageEnglish (US)
Title of host publicationAlgorithms - ESA 1999 - 7th Annual European Symposium, Proceedings
PublisherSpringer Verlag
Pages163-171
Number of pages9
Volume1643
ISBN (Print)3540662510, 9783540662518
DOIs
StatePublished - 1999
Event7th Annual European Symposium on Algorithms, ESA 1999 - Prague, Czech Republic
Duration: Jul 16 1999Jul 18 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1643
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th Annual European Symposium on Algorithms, ESA 1999
CountryCzech Republic
CityPrague
Period7/16/997/18/99

Fingerprint

Task Assignment
Polynomials
Line
Polynomial Time Approximation Scheme
Arrival Time
Parallel Machines
Assignment Problem
Assignment
Minimise
Approximation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Azar, Y., & Regev, O. (1999). Off-line temporary tasks assignment. In Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings (Vol. 1643, pp. 163-171). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1643). Springer Verlag. https://doi.org/10.1007/3-540-48481-7_15

Off-line temporary tasks assignment. / Azar, Yossi; Regev, Oded.

Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Vol. 1643 Springer Verlag, 1999. p. 163-171 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1643).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Azar, Y & Regev, O 1999, Off-line temporary tasks assignment. in Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. vol. 1643, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1643, Springer Verlag, pp. 163-171, 7th Annual European Symposium on Algorithms, ESA 1999, Prague, Czech Republic, 7/16/99. https://doi.org/10.1007/3-540-48481-7_15
Azar Y, Regev O. Off-line temporary tasks assignment. In Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Vol. 1643. Springer Verlag. 1999. p. 163-171. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-48481-7_15
Azar, Yossi ; Regev, Oded. / Off-line temporary tasks assignment. Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. Vol. 1643 Springer Verlag, 1999. pp. 163-171 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0e137bb05d274b88b6e80468e76983e6,
title = "Off-line temporary tasks assignment",
abstract = "In this paper we consider the temporary tasks assignment problem. In this problem, there are m parallel machines and n independent jobs. Each job has an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to find an assignment that minimizes the maximum load over machines and time. We present a polynomial time approximation scheme for the case in which the number of machines is fixed. We also show that for the case in which the number of machines is given as part of the input (i.e., not fixed), no algorithm can achieve a better approximation ratio than4/3 unless P = NP.",
author = "Yossi Azar and Oded Regev",
year = "1999",
doi = "10.1007/3-540-48481-7_15",
language = "English (US)",
isbn = "3540662510",
volume = "1643",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "163--171",
booktitle = "Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings",

}

TY - GEN

T1 - Off-line temporary tasks assignment

AU - Azar, Yossi

AU - Regev, Oded

PY - 1999

Y1 - 1999

N2 - In this paper we consider the temporary tasks assignment problem. In this problem, there are m parallel machines and n independent jobs. Each job has an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to find an assignment that minimizes the maximum load over machines and time. We present a polynomial time approximation scheme for the case in which the number of machines is fixed. We also show that for the case in which the number of machines is given as part of the input (i.e., not fixed), no algorithm can achieve a better approximation ratio than4/3 unless P = NP.

AB - In this paper we consider the temporary tasks assignment problem. In this problem, there are m parallel machines and n independent jobs. Each job has an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to find an assignment that minimizes the maximum load over machines and time. We present a polynomial time approximation scheme for the case in which the number of machines is fixed. We also show that for the case in which the number of machines is given as part of the input (i.e., not fixed), no algorithm can achieve a better approximation ratio than4/3 unless P = NP.

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

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

U2 - 10.1007/3-540-48481-7_15

DO - 10.1007/3-540-48481-7_15

M3 - Conference contribution

AN - SCOPUS:84958093314

SN - 3540662510

SN - 9783540662518

VL - 1643

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 163

EP - 171

BT - Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings

PB - Springer Verlag

ER -