带有滞留时间的流水作业计划排序方法研究

A STUDY ON THE ALGORITHMS OF FLOW SHOP SCHEDULING WITH TIME LAG BETWEEN PROCESSES

本文对带有滞留时间的流水作业车间以零件加工全长最小为目标的排序问题进行了分析和研究。分析证明了对于两台机床带有滞留时间的问题存在有效的多项式算法。本文还给出了三台以上机床带有滞留时间排序问题的启发式算法。

This paper studies flowshop scheduling problems with time lag between processes with objective of minimizing makespan.It has proved that there exits an polynomial algorithm for two-machine problems.For three or more machine problems,an efficient heuristic algorithm is presented.