摘要
This paper studies the no-wait flowshop scheduling problem with total flow time criterion, which is NP complete in the strong sense. A self-adaptive ruin-and-recreate (SR&R) algorithm is proposed to solve this complex problem. The performance of the proposed SR&R algorithm is compared with that of the best available heuristics and the SR&R algorithm without the self-adaptive mechanism by application to a set of classic benchmark instances that were presented by Taillard. Computational results show that the proposed SR&R algorithm improves upon the best known solutions in more than half benchmark instances, and provides the best known solutions for the remaining unimproved instances in a reasonable computational time. The contribution of this work is to provide an easy-to-use approach to solve effectively and efficiently this practical but complex scheduling problem.
学科与关键词
- A population-based iterated greedy algorithm for no-wait job shop scheduling with total flow time criterionDeng, Guanlong*; Su, Qingtang; Zhang, Zhiwang; Liu, Huixia; Zhang, Shuning; Jiang, TianhuaENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 88: 103369.被引 34
- Iterative search method for total flowtime minimization no-wait flowshop problemZhu, Xia*; Li, XiaopingInternational Journal of Machine Learning and Cybernetics, 2015, 6(5): 747-761.被引 9
- Total completion time with makespan constraint in no-wait flowshops with setup timesAllahverdi, Ali*; Aydilek, HarunEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238(3): 724-734.被引 32
