传送带排序问题初探

本文对几种不同的m,利用讨论加工时间的公约数和最小公倍数的方法,给出了全部加工完该批工件所用时间最短的传送方法,该方法计算简单、易于实现。

We discuss the sequencing problem of this system for different m, and develop an algorithm by considering the common divisor and the smallest common multiple of the processing time of the parts to minimize the makespan. This algorithm is simple computationally and easy to realize.