aggregate length

Computational complexity of the makespan of the three-stage flow-shop with some batch machines;

含有批处理机的三机流水作业加工总长问题的计算复杂性

In this paper, we investigate the computational complexity of the makespan of the three-stage flow-shop with some batch machines in some cases.

本文研究含有批处理机的三台机器流水作业加工总长问题在某些情形下的计算复杂性。

It is conjectured that the makespan of any dense schedule is at most 2-1/ m times the optimal makespan, where m is the number of machines.

其加工总长与最优值之比具有上界 2 - 1 /m(m为机器数 ) ,是一个尚未证明的猜想。