Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657855 | Theoretical Computer Science | 2005 | 13 Pages |
Abstract
We are given a set of identical machines and a sequence of jobs, the sum of whose weights is known in advance. The jobs are to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. These results improve on the recent results by Azar and Regev, who proposed an algorithm with performance ratio 1.625 for the less general problem that the optimal makespan is known in advance.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
T.C. Edwin Cheng, Hans Kellerer, Vladimir Kotov,