Publikace na Matematicko-fyzikální fakulta |
2004
Abstrakt
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.