Heuristic for no-wait flow shop scheduling optimization
一种求解无等待流水车间调度优化的启发式算法

This paper proposed a new heuristic algorithm, named SDH heuristic, for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. The SDH heuristic was based on the well-known NEH heuristic. Firstly, elaborated the total flowtime. Secondly, it presented the SDH heuristic. It carried out extensive computational experiments based on a set of well-known benchmark instances at last. Computational results and comparison show the effectiveness of the SDH heuristic in solving the no-wait flow shop scheduling with total flowtime criterion.