摘要
An improved iterated greedy algorithm (IIGA) is proposed in this paper to solve the no-wait flow shop scheduling problem with the objective to minimize the makespan. In the proposed IIGA, firstly, a speed-up method for the insert neighborhood is developed to evaluate the whole insert neighborhood of a single solution with (n-1)(2)supercript stop neighbors in time O(n(2)), where n is the number of jobs; secondly, an improved Nawaz-Enscore-Ham (NEH) heuristic is presented for constructing solutions in the initial stage and searching process; thirdly, a simple local search algorithm based on the speed-up method is incorporated into the iterated greedy algorithm to perform exploitation. The computational results based on some well-known benchmarks show that the proposed IIGA can obtain results better than those from some existing approaches in the literature.
学科与关键词
- 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
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemRuiz, Ruben*; Stutzle, ThomasEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177(3): 2033-2049.被引 812
- 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
