A discrete particle swarm optimization with combined priority dispatching rules for hybrid flow shop scheduling problem
In this paper, an algorithm based on particle swarm optimization is proposed, for hybrid flow shop scheduling problem, to minimize the makespan. First an effective new approach using two decisions based on parallel priority dispatching rules is applied. Next we develop an hybridizing DPSO, that presents new components to updating velocity and position using genetic operators, with an adaptive neighborhood procedure based on insert-interchange mutation. The performance of the proposed algorithm was tested on benchmark problems of Carlier and Neron [8].
Paper
Full text
A discrete particle swarm optimization with combined priority dispatching rules for hybrid flow shop scheduling problem
Semantic Scholar · Computer Science · 2015
Abstract
In this paper, an algorithm based on particle swarm optimization is proposed, for hybrid flow shop scheduling problem, to minimize the makespan. First an effective new approach using two decisions based on parallel priority dispatching rules is applied. Next we develop an hybridizing DPSO, that presents new components to updating velocity and position using genetic operators, with an adaptive neighborhood procedure based on insert-interchange mutation. The performance of the proposed algorithm was tested on benchmark problems of Carlier and Neron [8].