### 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 than^{4}/_{3} unless P = NP.

Original language | English (US) |
---|---|

Title of host publication | Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings |

Publisher | Springer Verlag |

Pages | 163-171 |

Number of pages | 9 |

Volume | 1643 |

ISBN (Print) | 3540662510, 9783540662518 |

DOIs | |

State | Published - 1999 |

Event | 7th Annual European Symposium on Algorithms, ESA 1999 - Prague, Czech Republic Duration: Jul 16 1999 → Jul 18 1999 |

### Publication series

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

Volume | 1643 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 7th Annual European Symposium on Algorithms, ESA 1999 |
---|---|

Country | Czech Republic |

City | Prague |

Period | 7/16/99 → 7/18/99 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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 -