|
|||||
|
|
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines |
|
| Authors: | Leah Epstein\thanks{School of Computer Science The Interdisciplinary Center Herzliya Israel lea@idcacil and Jiri Sgall |
| Affiliation: | (1) School of Computer Science, The Interdisciplinary Center, Herzliya, Israel;(2) Mathematical Institute, AS CR, Zitná 25, CZ-11567 Praha 1, Czech Republic |
| 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, including minimizing the lp norm of the vector of completion times. This generalizes and simplifies many previous results in this area. |
| Keywords: | Scheduling Approximation algorithms Parallel machines Machine completion time Polynomial time approximation scheme |
| 本文献已被 SpringerLink 等数据库收录！ | |