Off-line temporary tasks assignment

Yossi Azar, Oded Regev, Jiří Sgall, Gerhard J. Woeginger

Research output: Contribution to journalConference articlepeer-review


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 polynomial algorithm can achieve a better approximation ratio than 3/2 unless P = NP.

Original languageEnglish (US)
Pages (from-to)419-428
Number of pages10
JournalTheoretical Computer Science
Issue number2
StatePublished - Sep 28 2002
EventAlgorthims (ESA'99) - Prague, Czech Republic
Duration: Jul 16 1999Jul 18 1999

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Off-line temporary tasks assignment'. Together they form a unique fingerprint.

Cite this