Parallel Hybrid Particle Swarm Algorithm for Workshop Scheduling Based on Spark

In hybrid mixed-flow workshop scheduling, there are problems such as mass production, mass manufacturing, mass assembly and mass synthesis of products. In order to solve these problems, combined with the Spark platform, a hybrid particle swarm algorithm that will be parallelized is proposed. Compared with the existing intelligent algorithms, the parallel hybrid particle swarm algorithm is more conducive to the realization of the global optimal solution. In the loader manufacturing workshop, the optimization goal is to minimize the maximum completion time and a parallelized hybrid particle swarm algorithm is used. The results show that in the case of relatively large batches, the parallel hybrid particle swarm algorithm can effectively obtain the scheduling plan and avoid falling into the local optimal solution. Compared with algorithm serialization, algorithm parallelization improves algorithm efficiency by 2–4 times. The larger the batches, the more obvious the algorithm parallelization improves computational efficiency.

[1]  Czesław Smutnicki,et al.  A two-machine permutation flow shop scheduling problem with buffers , 1998 .

[2]  Jinwoo Park,et al.  Multi-level job scheduling in a flexible job shop environment , 2014 .

[3]  Zongyan Cai,et al.  Improved hybrid immune clonal selection genetic algorithm and its application in hybrid shop scheduling , 2018, Cluster Computing.

[4]  Bassem Jarboui,et al.  Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem , 2016, J. Comput. Des. Eng..

[5]  Fuqing Zhao,et al.  An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem , 2014, Comput. Oper. Res..

[6]  Scott Shenker,et al.  Spark: Cluster Computing with Working Sets , 2010, HotCloud.

[7]  张宏国,et al.  Single piece and small batch mixed-shop scheduling algorithm , 2015 .

[8]  G. M. Komaki,et al.  Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems , 2016 .

[9]  Ming Huang,et al.  An Improved Genetic Algorithm with Adaptive Variable Neighborhood Search for FJSP , 2019, Algorithms.

[10]  Ahmet Bolat,et al.  Flow-shop scheduling for three serial stations with the last two duplicate , 2005, Comput. Oper. Res..

[11]  Jean-Charles Billaut,et al.  Total completion time minimization in a computer system with a server and two parallel processors , 2005, Comput. Oper. Res..

[12]  Morteza Kiani,et al.  An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem , 2014 .

[13]  Nejah Nasri,et al.  3D node deployment strategies prediction in wireless sensors network , 2020, International Journal of Electronics.