Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Quanke, P., Ling, W., Liang, G., et al.: Differential evolution algorithm based on blocks on critical path for job shop scheduling problems. J. Mech. Eng. 46(22), 182–188 (2010)
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. INFORMS (1976)
Zhang, C.Y., Li, P.G., Guan, Z.L., et al.: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput. Oper. Res. 34(11), 3229–3242 (2007)
Zhang, R., Wu, C.: A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective. Comput. Oper. Res. 38(5), 854–867 (2011)
Kuhpfahl, J., Bierwirth, C.: A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective. Elsevier Science Ltd. (2016)
Bierwirth, C., Kuhpfahl, J.: Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. Eur. J. Oper. Res. 261, 835–848 (2017)
Topaloglu, S., Kilincli, G.: A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization. Int. J. Adv. Manuf. Technol. 44(7–8), 781–794 (2009)
Qian, B., Li, Z.H., Hu, R., et al.: A hybrid differential evolution algorithm for the multi-objective reentrant job-shop scheduling problem, pp. 485–489 (2013)
Mirjalili, S., Gandomi, A.H., et al.: Salp Swarm Algorithm: a bio-inspired optimizer for engineering design problems. Adv. Eng. Softw. 114, 163–191 (2017)
Elfergany, A.A., Kalogirou, S.A., Christodoulides, P.: Extracting optimal parameters of PEM fuel cells using Salp Swarm Optimizer. Renew. Energy 119, 641–648 (2018)
Abdel-Basset, M., Gunasekaran, M., El-Shahat, D., et al.: A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener. Comput. Syst. 85, 129–145 (2018)
Kurdi, M.: An effective new island model genetic algorithm for job shop scheduling problem. Comput. Oper. Res. 67, 132–142 (2016)
Acknowledgements
This research is partially supported by the National Science Foundation of China (51665025), and the Applied Basic Research Foundation of Yunnan Province (2015FB136).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Sun, ZX., Hu, R., Qian, B., Liu, B., Che, GL. (2018). Salp Swarm Algorithm Based on Blocks on Critical Path for Reentrant Job Shop Scheduling Problems. In: Huang, DS., Bevilacqua, V., Premaratne, P., Gupta, P. (eds) Intelligent Computing Theories and Application. ICIC 2018. Lecture Notes in Computer Science(), vol 10954. Springer, Cham. https://doi.org/10.1007/978-3-319-95930-6_64
Download citation
DOI: https://doi.org/10.1007/978-3-319-95930-6_64
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95929-0
Online ISBN: 978-3-319-95930-6
eBook Packages: Computer ScienceComputer Science (R0)