Publication at Faculty of Mathematics and Physics |
2004
Abstract
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the machine completion times.