Permutation flow shop scheduling: fuzzy particle swarm optimization approach

Abstract

A fuzzy particle swarm optimization (PSO) for the minimization of makespan in permutation flow shop scheduling problem is presented in this paper. In the proposed fuzzy PSO, the inertia weight of PSO and the control parameter of the cross-mutated operation are determined by a set of fuzzy rules. To escape the local optimum, cross-mutated operation is introduced. In order to make PSO suitable for solving permutation flow shop scheduling problem, a roulette wheel mechanism is proposed to convert the continuous position values of particles to job permutations. Meanwhile, a swap-based local search for scheduling problem is designed for the local exploration on a discrete job permutation space. Flow shop benchmark functions are employed to evaluate the performance of the fuzzy PSO for flow shop scheduling problems and the results indicate that the algorithm performs better compared with existing hybrid PSO algorithms.