An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem

Authors:
Changsheng Zhang;Jigui Sun
Affiliations:
College of Computer Science and Technology, Jilin University, 2699 Qianjin Street, Changchun 130012, China and Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Edu ...;College of Computer Science and Technology, Jilin University, 2699 Qianjin Street, Changchun 130012, China and Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Edu ...
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 4
Cited 2

A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research
An exact approach to early/tardy scheduling with release dates

Computers and Operations Research
Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Recent developments in evolutionary computation for manufacturingoptimization: problems, solutions, and comparisons

IEEE Transactions on Evolutionary Computation

A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems

Expert Systems with Applications: An International Journal
An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure

Advances in Engineering Software

Quantified Score

Hi-index	12.05

Visualization

Abstract

An alternate two phases particle swarm optimization algorithm called ATPPSO is proposed to solve the flow shop scheduling problem with the objective of minimizing makespan. It includes two processes, the attractive process and the repulsive process which execute alternatively. In order to refrain from the shortcoming of premature convergence, a two point reversal crossover operator is defined and in the repulsive process each particle is made to fly towards some promising areas which can introduce some new information to guide the swarm searching process. In order to improve the algorithm speed, a fast makespan computation method based on matrix is designed. Finally, the proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The results show that the solution quality and the convergence speed of the ATPPSO algorithm both precede the other two algorithms. It can be used to solve large scale flow shop scheduling problem effectively.