摘要
In this paper, the no-wait flowshop problem with total flowtime minimization is considered. In order to fast evaluate a new solution generated in the searching process in an algorithm, the objective increment properties of fundamental operators are analyzed on the basis of the distance of adjacent jobs in a sequence. An iterative search method is proposed for the considered problem. Two initial solutions are constructed by two investigated heuristics, and assigned as the parent solutions. The parent solutions are improved iteratively by a mini-evolutionary algorithm based on perturbation cycle. Each perturbation cycle consists of a perturb operation and an enhancement process following two strategies: (1) segment-based local search, and (2) iterative global search. The proposed method is compared with the best existing algorithms under the classical benchmark instances. Computational result reveals that the proposed method outperforms the others on effectiveness.
学科与关键词
- 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
- An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterionPan, Quan-Ke*; Wang, Ling; Zhao, Bao-HuaINTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38(7-8): 778-786.被引 88
- Self-adaptive ruin-and-recreate algorithm for minimizing total flow time in no-wait flowshopsYing, Kuo-Ching; Lin, Shih-Wei*; Wu, Wen-JieCOMPUTERS & INDUSTRIAL ENGINEERING, 2016, 101: 167-176.被引 9
