An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion

• Published in: International journal of advanced manufacturing technology Vol. 38; no. 7-8; pp. 778 - 786
• Main Authors: Pan, Quan-Ke, Wang, Ling, Zhao, Bao-Hua
• Format: Journal Article
• Language: English
• Published: London Springer-Verlag 01.09.2008; Springer Nature B.V
• Subjects: Algorithms; CAE) and Design; Computer-Aided Engineering (CAD; Engineering; Greedy algorithms; Industrial and Production Engineering; Job shop scheduling; Job shops; Mechanical Engineering; Media Management; Original Article; Production scheduling; Search algorithms; Sequential scheduling; Local search; Speed-up method; Iterated greedy algorithm; Makespan; No-wait flow shop; Insert neighborhood
• ISSN: 0268-3768; 1433-3015
• DOI: 10.1007/s00170-007-1120-y

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 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.