Salp Swarm Algorithm Based on Blocks on Critical Path for Reentrant Job Shop Scheduling Problems

In this paper, salp swarm algorithm based on blocks on critical path (SSA_BCP) is presented to minimize the makespan for reentrant job shop scheduling problem (RJSSP), which is a typical NP-complete combinational optimization problem. Firstly, the mathematical model of RJSSP based on the disjunctive graph is established. Secondly, the extended reentrant-smallest-order-value (RSOV) encoding rule is designed to transform SSA’s individuals from real vectors to job permutations so that SSA can be used to perform global search for finding high-quality solutions or regions in the solution space. Thirdly, four kinds of neighborhood structures are defined after defining the insert operation based on block structure, which can be used to avoid search in the invalid regions. Then, a high-efficient local search integrating multiple neighborhoods is proposed to execute a thorough search from the promising regions found by the global search. Simulation results and comparisons show the effectiveness of the proposed algorithm.

[1]  Mohamed Abdel-Basset,et al.  A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem , 2018, Future Gener. Comput. Syst..

[2]  Wenxue Qian.  Reliability Modeling and Assessment of Load Dependent Multiple Weak Site Parts , 2010 .

[3]  Seyda Topaloglu,et al.  A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization , 2009 .

[4]  Christian Bierwirth,et al.  A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective , 2016, Comput. Oper. Res..

[5]  Quanke Pan,et al.  Differential Evolution Algorithm Based on Blocks on Critical Path for Job Shop Scheduling Problems , 2010 .

[6]  C. Bierwirth,et al.  Extended GRASP for the job shop scheduling problem with total weighted tardiness objective , 2017, Eur. J. Oper. Res..

[7]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[8]  Rui Zhang,et al.  A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective , 2011, Comput. Oper. Res..

[9]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[10]  Attia A. El-Fergany,et al.  Extracting optimal parameters of PEM fuel cells using Salp Swarm Optimizer , 2018 .

[11]  Hossam Faris,et al.  Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems , 2017, Adv. Eng. Softw..

[12]  Bin Qian,et al.  A hybrid differential evolution algorithm for the multi-objective reentrant job-shop scheduling problem , 2013, 2013 10th IEEE International Conference on Control and Automation (ICCA).

[13]  Mohamed Kurdi,et al.  An effective new island model genetic algorithm for job shop scheduling problem , 2016, Comput. Oper. Res..

[14]  Rui Zhang,et al.  Corrigendum to "A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective" [Computers and Operations Research 38 (2011) 854-867] , 2013, Comput. Oper. Res..