A HEURISTIC ALGORITHM FOR THE M-MACHINE, N-JOB FLOWSHOP SEQUENCING PROBLEM
A HEURISTIC ALGORITHM FOR THE M-MACHINE, N-JOB FLOWSHOP SEQUENCING PROBLEM
复制标题
DOI：
10.1016/0305-0483(83)90088-9
复制
发表时间：
1983-01-01
影响因子：
6.9
通讯作者：
HAM, I
中科院分区：
文献类型：
--
作者：
NAWAZ, M;ENSCORE, EE;HAM, I
在一般的流水作业情况下，所有的工件必须以相同的顺序通过所有的机器，某些启发式算法建议，具有较高的总加工时间的工件应给予较高的优先级比具有较少的总加工时间的工件。在此前提下，本文提出了一种简单的算法，与现有的算法相比，该算法产生了非常好的序列。Park [13]在一项独立研究中将该算法的结果与其他15种算法的结果进行了比较，结果表明，该算法在静态和动态排序环境中对大型流水车间问题的处理效果特别好。
In a general flow-shop situation, where all the jobs must pass through all the machines in the same order, certain heuristic algorithms propose that the jobs with higher total process time should be given higher priority than the jobs with less total process time. Based on this premise, a simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics. The results of the proposed algorithm have been compared with the results from 15 other algorithms in an independent study by Park [13], who shows that the proposed algorithm performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.