Minimizing makespan on an m-machine re-entrant flowshop
Minimizing makespan on an m-machine re-entrant flowshop
复制标题
DOI：
10.1016/j.cor.2006.09.028
复制
发表时间：
2008-05
期刊：
影响因子：
--
通讯作者：
Seong-Woo Choi;Yeong-Dae Kim
中科院分区：
文献类型：
--
作者：
Seong-Woo Choi;Yeong-Dae Kim
研究了以最小化完工时间为目标的多机可重入流水车间调度问题。在这里考虑的可重入流水作业中，所有作业的路径与普通流水作业中的路径相同，但是作业必须在机器上多次处理。我们提出了启发式算法，这是修改从已知的现有算法一般的m-机流水作业问题或新开发的这项研究。为了评估算法的性能，随机生成的测试问题和结果进行了计算实验报告。
This paper focuses on an m-machine re-entrant flowshop scheduling problem with the objective of minimizing makespan. In the re-entrant flowshop considered here, routes of all jobs are identical as in ordinary flowshops, but the jobs must be processed multiple times on the machines. We present heuristic algorithms, which are modified from well-known existing algorithms for the general m-machine flowshop problem or newly developed in this research. For evaluation of the performance of the algorithms, computational experiments are performed on randomly generated test problems and results are reported.