The circular discrete particle swarm optimization algorithm for flow shop scheduling problem

Authors:
Jindong Zhang;Changsheng Zhang;Shubin Liang
Affiliations:
College of Computer Science and Technology, Jilin University, Changchun 130012, China;College of Computer Science and Technology, Jilin University, Changchun 130012, China;College of Computer Science and Technology, Henan Normal University, Xinxiang 453007, China
Venue:
Expert Systems with Applications: An International Journal
Year:
2010

Citing 6
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
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research
A combinatorial particle swarm optimisation for solving permutation flowshop problems

Computers and Industrial Engineering
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 ant colony algorithm for makespan minimization in permutation flow shops

Computers and Industrial Engineering
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

A circular discrete particle swarm optimization algorithm CDPSO is proposed to solve the flow shop scheduling problem with the objective of minimizing makespan. A particle similarity and swarm activity metric are defined. In order to preserve the diversity of the swarm, an order strategy is introduced. The threshold of the particle similarity changes adaptively with the swarm evolving degree. When the swarm activity is below a specified threshold, the obtained useful information is used to make the swarm evolve circularly. Furthermore, in order to improve the performance of CDPSO algorithm further, a neighborhood structure is defined and a neighborhood search strategy is proposed and introduced into it. Finally, the CDPSO algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The result shows that the solution quality and the stability of the CDPSO both precede the other two algorithms. It can be used to solve large scale flow shop scheduling problem.