利用有希望子序列求解无等待Flowshop调度问题
Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem
摘要:
无等待流水车间调度问题是经典置换流水车间调度问题的一个变种,它附加了一个约束条件,即工件必须由连续的机器在没有等待时间的情况下处理。为了有效地解决这个NP难的组合优化问题,我们进行了分析的结构,高质量的解决方案。这个分析表明,No-Wait特异性给了它们一个共同的结构:它们共享相同的作业子序列,我们称之为超级作业。在讨论了如何识别这些超级作业之后,我们提出了IG-SJ,该算法利用经典置换流水作业的最新算法,即著名的迭代贪婪(IG)算法中的超级作业。本文还提出了IG-SJ的迭代方法。在Taillard实例上进行了实验。实验结果表明,IG-SJ能够找到64个新的最优解,从而成功地开发了超级作业。
英文摘要:
The no-wait flowshop scheduling problem is a variant of the classical permutation flowshop problem, with the additional constraint that jobs have to be processed by the successive machines without waiting time. To efficiently address this NP-hard combinatorial optimization problem we conduct an analysis of the structure of good quality solutions. This analysis shows that the No-Wait specificity gives them a common structure: they share identical sub-sequences of jobs, we call super-jobs. After a discussion on the way to identify these super-jobs, we propose IG-SJ, an algorithm that exploits super-jobs within the state-of-the-art algorithm for the classical permutation flowshop, the well-known Iterated Greedy (IG) algorithm. An iterative approach of IG-SJ is also proposed. Experiments are conducted on Taillard's instances. The experimental results show that exploiting super-jobs is successful since IG-SJ is able to find 64 new best solutions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。