排序方式： 共有1条查询结果，搜索用时 0 毫秒
1
1.
Approximation Schemes for Scheduling
on Uniformly Related and Identical Parallel Machines 总被引：3，自引：0，他引：3
Leah Epstein thanks{School of Computer Science The Interdisciplinary Center Herzliya Israel. lea@idc.ac.il. Jiri Sgall 《Algorithmica》2004,39(1):43-57
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. 相似文献
1