2
Download:
|
|
by Yossi Azar, Oded Regev
http://www.math.tau.ac.il/~azar/offtask.ps.gz
Add To MetaCart
Abstract:
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
Citations
| 833 | Reducibility among Combinatorial Problems – Karp - 1972 |
| 429 | Online computation and competitive analysis – Borodin, El-Yaniv - 1998 |
| 289 | Bounds on Multiprocessing Timing Anomalies – Graham - 1969 |
| 138 | Using dual approximation algorithms for scheduling problems: Theoretical and practical results – Hochbaum, Shmoys - 1987 |
| 134 | Approximation algorithms for scheduling unrelated parallel machines – Lenstra, Shmoys, et al. - 1990 |
| 103 | Online load balancing – Azar - 1998 |
| 102 | Bounds for certain multiprocessor anomalies. Bell System Technical Journal 45 – Graham - 2001 |
| 56 | 1976]. Algorithms for scheduling independent tasks – Sahni - 2000 |
| 14 | On-line load balancing of temporary tasks on identical machines – Azar, Epstein - 1997 |
