Double Bare Bones Particle Swarm Algorithm for Solving Flexible Job-shop Scheduling Problem

Authors

Yueming Dai, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China;
Minghui Wang, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China;
Wang Chun, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China;
Wang Yan, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China;

Abstract

Abstract: To solve flexible job shop scheduling problem, a double bare bones particle swarm algorithm (DBBPSO) was proposed to minimize the makespan. Combining Von-neumann bare bones particle swarm optimization algorithm and chaotic mutation bare bones particle swarm optimization algorithm, the algorithm DBBPSO used a communication method to cooperate evolution. This approach could keep balance between global exploration and local exploration, and a machine selection method was proposed based on the tenet of minimizing makespan. The proposed algorithm was compared with other algorithms on four benchmark problems and a scheduling optimization example. Simulation results indicate that the improved algorithm has the ability to obtain the optimal solution, and it is more suitable for solving the scheduling problem.

Recommended Citation

Dai, Yueming; Wang, Minghui; Chun, Wang; and Yan, Wang (2020) "Double Bare Bones Particle Swarm Algorithm for Solving Flexible Job-shop Scheduling Problem," Journal of System Simulation: Vol. 29: Iss. 6, Article 15.
DOI: 10.16182/j.issn1004731x.joss.201706015
Available at: https://dc-china-simulation.researchcommons.org/journal/vol29/iss6/15

First Page

1268

Revised Date

2016-11-06

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201706015

Last Page

1276

CLC

TP278

Recommended Citation

Dai Yueming, Wang Minghui, Wang Chun, Wang Yan. Double Bare Bones Particle Swarm Algorithm for Solving Flexible Job-shop Scheduling Problem[J]. Journal of System Simulation, 2017, 29(6): 1268-1276.

DOI

10.16182/j.issn1004731x.joss.201706015