A particle swarm optimization approach for permutation flow shop scheduling problem

Abstract

Flow shop scheduling problem (FSSP) is a combinatorial optimization problem. This work, with the objective of optimizing the makespan of an FSSP uses a particle swarm optimization (PSO) approach. The problems are tested on Taillard’s benchmark problems. The results of Nawaz, Encore and Ham (NEH) heuristic are initialized to the PSO to direct the search into a quality space. Variable neighbourhood search (VNS) is employed to overcome the early convergence of the PSO and helps in global search. The results are compared with standalone PSO, traditional heuristics and the Taillard’s upper bounds. Five problem set are taken from Taillard’s benchmark problems and are solved for various problem sizes. Thus a total of 35 problems are solved. The experimental results show that the solution quality of FSSP can be improved if the search is directed in a quality space based on the proposed PSO approach (PSO-NEH-VNS).

Keywords

• makespan
• flow shop scheduling
• particle swarm optimization
• variable neighbourhood search