论文部分内容阅读
考虑并行批加工机上不同尺寸工件的调度问题;目标是极小化最大完工时间.给出了一个(2+ε)-近似算法,ε>0可以任意小.
The scheduling problem of workpieces of different sizes in parallel batch machines is considered. The goal is to minimize the maximum completion time. A (2 + ε) - approximation algorithm is given, and ε> 0 can be arbitrarily small.