Total completion time with makespan constraint in no-wait flowshops with setup times
Total completion time with makespan constraint in no-wait flowshops with setup times
复制标题
DOI：
10.1016/j.ejor.2014.04.031
复制
发表时间：
2014-11
期刊：
影响因子：
--
通讯作者：
A. Allahverdi;H. Aydilek
中科院分区：
文献类型：
--
作者：
A. Allahverdi;H. Aydilek
研究了以最小化总完工时间为目标的主题机无等待流水车间调度问题，其最大完工时间不大于某个值。设置时间被认为是非零值，因此，设置时间被视为与处理时间分开。几个最近的算法，插入算法，两个遗传算法，三个模拟退火算法，两个基于云理论的模拟退火算法，和差分进化算法的适应，并提出了这个问题。一个广泛的计算分析已经进行了评估所提出的算法。计算分析表明，在相同的计算时间下，所提出的九种算法中的一种模拟退火算法（伊萨-2）的性能明显优于其他算法。此外，分析表明，算法ISA-2的性能显着优于早期现有的最佳算法。具体而言，本文提出的最佳性能算法伊萨-2，在相同的计算时间下，将文献中现有的最佳算法的误差减少了至少90%。所有结果都经过统计检验。
Them-machine no-wait flowshop scheduling problem with the objective of minimizing total completion time subject to the constraint that the makespan value is not greater than a certain value is addressed in this paper. Setup times are considered non-zero values, and thus, setup times are treated as separate from processing times. Several recent algorithms, an insertion algorithm, two genetic algorithms, three simulated annealing algorithms, two cloud theory-based simulated annealing algorithms, and a differential evolution algorithm are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that one of the nine proposed algorithms, one of the simulated annealing algorithms (ISA-2), performs much better than the others under the same computational time. Moreover, the analysis indicates that the algorithmISA-2performs significantly better than the earlier existing best algorithm. Specifically, the best performing algorithm,ISA-2, proposed in this paper reduces the error of the existing best algorithm in the literature by at least 90% under the same computational time. All the results have been statistically tested.