考虑并行批加工机上不同尺寸工件的调度问题;目标是极小化最大完工时间.给出了一个(2+ε)一近似算法.ε〉0可以任意小.
The problem of scheduling jobs with non-identical sizes on parallel batehing machines is considered; the objective is to minimize the maximum completion time (makespan). A (2 + ε )-approximation algorithm is presented, where ε〉 0 can be made arbitrarily small.