### 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 |

Editors | Jaroslav Nešetřil |

Publisher | Springer Verlag |

Pages | 163-171 |

Number of pages | 9 |

ISBN (Print) | 3540662510, 9783540662518 |

DOIs | |

State | Published - Jan 1 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) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### 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

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings*(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