{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T22:00:02Z","timestamp":1781388002363,"version":"3.54.1"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T00:00:00Z","timestamp":1676332800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T00:00:00Z","timestamp":1676332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010878","name":"State Administration for Science, Technology and Industry for National Defense","doi-asserted-by":"publisher","award":["JCKY2018210A001"],"award-info":[{"award-number":["JCKY2018210A001"]}],"id":[{"id":"10.13039\/501100010878","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10489-023-04479-7","type":"journal-article","created":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T03:04:01Z","timestamp":1676343841000},"page":"18925-18958","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A self-learning discrete salp swarm algorithm based on deep reinforcement learning for dynamic job shop scheduling problem"],"prefix":"10.1007","volume":"53","author":[{"given":"Yiming","family":"Gu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,14]]},"reference":[{"key":"4479_CR1","doi-asserted-by":"publisher","unstructured":"Xiong H, Shi S, Ren D et al (2022) A survey of job shop scheduling problem: the types and models. Comput Oper Res 142. https:\/\/doi.org\/10.1016\/j.cor.2022.105731","DOI":"10.1016\/j.cor.2022.105731"},{"key":"4479_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.jmsy.2022.08.008","volume":"65","author":"A Prashar","year":"2022","unstructured":"Prashar A, Tortorella GL, Fogliatto FS (2022) Production scheduling in industry 4.0: morphological analysis of the literature and future research agenda. J Manuf Syst 65:33\u201343. https:\/\/doi.org\/10.1016\/j.jmsy.2022.08.008","journal-title":"J Manuf Syst"},{"key":"4479_CR3","doi-asserted-by":"publisher","unstructured":"Luo S (2020) Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Appl Soft Comput 91. https:\/\/doi.org\/10.1016\/j.asoc.2020.106208","DOI":"10.1016\/j.asoc.2020.106208"},{"key":"4479_CR4","doi-asserted-by":"publisher","unstructured":"Li YF, He Y, Wang YL et al (2020) An optimization method for energy-conscious production in flexible machining job shops with dynamic job arrivals and machine breakdowns. J Clean Prod 254. https:\/\/doi.org\/10.1016\/j.jclepro.2020.120009","DOI":"10.1016\/j.jclepro.2020.120009"},{"issue":"23","key":"4479_CR5","doi-asserted-by":"publisher","first-page":"14,893","DOI":"10.1007\/s00500-021-06053-0","volume":"25","author":"A Baykaso\u011flu","year":"2021","unstructured":"Baykaso\u011flu A, Madeno\u011flu FS (2021) Greedy randomized adaptive search procedure for simultaneous scheduling of production and preventive maintenance activities in dynamic flexible job shops. Soft Comput 25(23):14,893\u201314,932. https:\/\/doi.org\/10.1007\/s00500-021-06053-0","journal-title":"Soft Comput"},{"key":"4479_CR6","doi-asserted-by":"publisher","unstructured":"Duan JG, Wang JH (2021) Energy-efficient scheduling for a flexible job shop with machine breakdowns considering machine idle time arrangement and machine speed level selection. Comput Industr Eng 161. https:\/\/doi.org\/10.1016\/j.cie.2021.107677","DOI":"10.1016\/j.cie.2021.107677"},{"key":"4479_CR7","doi-asserted-by":"publisher","unstructured":"Gupta S, Jain A (2021) Analysis of integrated preventive maintenance and machine failure in stochastic flexible job shop scheduling with sequence-dependent setup time. Smart Sci:1\u201323. https:\/\/doi.org\/10.1080\/23080477.2021.1992823","DOI":"10.1080\/23080477.2021.1992823"},{"issue":"10","key":"4479_CR8","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1080\/00207543.2018.1524165","volume":"57","author":"M Shahgholi Zadeh","year":"2018","unstructured":"Shahgholi Zadeh M, Katebi Y, Doniavi A (2018) A heuristic model for dynamic flexible job shop scheduling problem considering variable processing times. Int J Prod Res 57(10):3020\u20133035. https:\/\/doi.org\/10.1080\/00207543.2018.1524165","journal-title":"Int J Prod Res"},{"key":"4479_CR9","doi-asserted-by":"publisher","unstructured":"Li K, Deng Q, Zhang L et al (2021) An effective mcts-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput Industr Eng, 155. https:\/\/doi.org\/10.1016\/j.cie.2021.107211","DOI":"10.1016\/j.cie.2021.107211"},{"key":"4479_CR10","doi-asserted-by":"publisher","unstructured":"Meng L, Zhang C, Ren Y et al (2020) Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput Industr Eng 142. https:\/\/doi.org\/10.1016\/j.cie.2020.106347","DOI":"10.1016\/j.cie.2020.106347"},{"issue":"4","key":"4479_CR11","doi-asserted-by":"publisher","first-page":"3387","DOI":"10.1109\/LRA.2018.2850056","volume":"3","author":"B Yan","year":"2018","unstructured":"Yan B, Bragin MA, Luh PB (2018) Novel formulation and resolution of job-shop scheduling problems. IEEE Robot Autom Lett 3(4):3387\u20133393. https:\/\/doi.org\/10.1109\/lra.2018.2850056","journal-title":"IEEE Robot Autom Lett"},{"key":"4479_CR12","doi-asserted-by":"publisher","unstructured":"Kouider A, Ait Haddad\u00c8Ne H (2021) A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach. Comput Oper Res 132. https:\/\/doi.org\/10.1016\/j.cor.2021.105319","DOI":"10.1016\/j.cor.2021.105319"},{"key":"4479_CR13","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ijpe.2019.04.024","volume":"216","author":"KD Sweeney","year":"2019","unstructured":"Sweeney KD, Sweeney DC, Campbell JF (2019) The performance of priority dispatching rules in a complex job shop: a study on the upper mississippi river. Int J Prod Econ 216:154\u2013172. https:\/\/doi.org\/10.1016\/j.ijpe.2019.04.024","journal-title":"Int J Prod Econ"},{"issue":"4","key":"4479_CR14","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K Gao","year":"2019","unstructured":"Gao K, Cao Z, Zhang L et al (2019) A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE\/CAA J Automatica Sinica 6(4):904\u2013916. https:\/\/doi.org\/10.1109\/jas.2019.1911540","journal-title":"IEEE\/CAA J Automatica Sinica"},{"key":"4479_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH, Mirjalili SZ et al (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191. https:\/\/doi.org\/10.1016\/j.advengsoft.2017.07.002","journal-title":"Adv Eng Softw"},{"key":"4479_CR16","doi-asserted-by":"publisher","unstructured":"Sun ZX, Hu R, Qian B et al (2018) Salp swarm algorithm based on blocks on critical path for reentrant job shop scheduling problems. In: International conference on intelligent computing. Springer, pp 638\u2013648. https:\/\/doi.org\/10.1007\/978-3-319-95930-6_64","DOI":"10.1007\/978-3-319-95930-6_64"},{"key":"4479_CR17","doi-asserted-by":"publisher","unstructured":"Jouhari H, Lei D, Al-qaness MAA et al (2020) Modified harris hawks optimizer for solving machine scheduling problems. Symmetry 12(9). https:\/\/doi.org\/10.3390\/sym12091460","DOI":"10.3390\/sym12091460"},{"key":"4479_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.apm.2021.01.017","volume":"94","author":"AA Ewees","year":"2021","unstructured":"Ewees AA, Al-qaness MAA, Abd Elaziz M (2021) Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times. Appl Math Model 94:285\u2013305. https:\/\/doi.org\/10.1016\/j.apm.2021.01.017","journal-title":"Appl Math Model"},{"key":"4479_CR19","doi-asserted-by":"publisher","unstructured":"Liu C, Yao Y, Zhu H (2021) Hybrid salp swarm algorithm for solving the green scheduling problem in a double-flexible job shop. Appl Sci 12(1). https:\/\/doi.org\/10.3390\/app12010205","DOI":"10.3390\/app12010205"},{"key":"4479_CR20","doi-asserted-by":"publisher","unstructured":"Chen F, Gao Y, Chen Zq et al (2005) Scga: controlling genetic algorithms with sarsa (0). In: International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC\u201906), vol 1. IEEE, pp 1177\u20131183. https:\/\/doi.org\/10.1109\/cimca.2005.1631422","DOI":"10.1109\/cimca.2005.1631422"},{"key":"4479_CR21","doi-asserted-by":"publisher","unstructured":"Hessel M, Modayil J, Van Hasselt H et al (2018) Rainbow: combining improvements in deep reinforcement learning. Proc AAAI conf Artif Intell 32(1). https:\/\/doi.org\/10.1609\/aaai.v32i1.11796","DOI":"10.1609\/aaai.v32i1.11796"},{"key":"4479_CR22","doi-asserted-by":"publisher","unstructured":"Para J, Del Ser J, Nebro AJ (2022) Energy-aware multi-objective job shop scheduling optimization with metaheuristics in manufacturing industries: a critical survey, results, and perspectives. Appl Sci 12(3). https:\/\/doi.org\/10.3390\/app12031491","DOI":"10.3390\/app12031491"},{"key":"4479_CR23","doi-asserted-by":"publisher","unstructured":"Mahmud S, Abbasi A, Chakrabortty RK et al (2021) Multi-operator communication based differential evolution with sequential tabu search approach for job shop scheduling problems. Appl Soft Comput, vol 108. https:\/\/doi.org\/10.1016\/j.asoc.2021.107470","DOI":"10.1016\/j.asoc.2021.107470"},{"key":"4479_CR24","doi-asserted-by":"publisher","unstructured":"Wu X, Che A (2020) Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search. Omega 94. https:\/\/doi.org\/10.1016\/j.omega.2019.102117","DOI":"10.1016\/j.omega.2019.102117"},{"key":"4479_CR25","doi-asserted-by":"publisher","unstructured":"Abdelmaguid TF (2020) Scatter search with path relinking for multiprocessor open shop scheduling. Comput Industr Eng 141. https:\/\/doi.org\/10.1016\/j.cie.2020.106292","DOI":"10.1016\/j.cie.2020.106292"},{"issue":"5","key":"4479_CR26","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1007\/s12559-020-09730-8","volume":"12","author":"D Molina","year":"2020","unstructured":"Molina D, Poyatos J, Ser JD et al (2020) Comprehensive taxonomies of nature- and bio-inspired optimization: Inspiration versus algorithmic behavior, critical analysis recommendations. Cognit Computat 12(5):897\u2013939. https:\/\/doi.org\/10.1007\/s12559-020-09730-8","journal-title":"Cognit Computat"},{"issue":"1","key":"4479_CR27","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms. Sci Amer 267(1):66\u201373","journal-title":"Sci Amer"},{"issue":"4","key":"4479_CR28","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Glob Optim"},{"issue":"6","key":"4479_CR29","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon D (2008) Biogeography-based optimization. IEEE Trans Evolution Computat 12(6):702\u2013713. https:\/\/doi.org\/10.1109\/TEVC.2008.919004","journal-title":"IEEE Trans Evolution Computat"},{"key":"4479_CR30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.engappai.2019.103330","volume":"87","author":"MH Sulaiman","year":"2020","unstructured":"Sulaiman MH, Mustaffa Z, Saari MM et al (2020) Barnacles mating optimizer: a new bio-inspired algorithm for solving engineering optimization problems. Eng Appl Artif Intell 87:103\u2013330. https:\/\/doi.org\/10.1016\/j.engappai.2019.103330","journal-title":"Eng Appl Artif Intell"},{"key":"4479_CR31","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995 - international conference on neural networks. IEEE. https:\/\/doi.org\/10.1109\/icnn.1995.488968","DOI":"10.1109\/icnn.1995.488968"},{"issue":"3","key":"4479_CR32","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459\u2013471. https:\/\/doi.org\/10.1007\/s10898-007-9149-x","journal-title":"J Glob Optim"},{"key":"4479_CR33","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"issue":"10","key":"4479_CR34","doi-asserted-by":"publisher","first-page":"5887","DOI":"10.1002\/int.22535","volume":"36","author":"BAS Gharehchopogh","year":"2021","unstructured":"Gharehchopogh BAS, Mirjalili S (2021) Artificial gorilla troops optimizer: a new nature-inspired metaheuristic algorithm for global optimization problems. Int J Intell Syst 36 (10):5887\u20135958. https:\/\/doi.org\/10.1002\/int.22535","journal-title":"Int J Intell Syst"},{"key":"4479_CR35","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.cie.2021.107408","volume":"158","author":"B Abdollahzadeh","year":"2021","unstructured":"Abdollahzadeh B, Gharehchopogh FS, Mirjalili S (2021) African vultures optimization algorithm: a new nature-inspired metaheuristic algorithm for global optimization problems. Comput Industr Eng 158:107\u2013408. https:\/\/doi.org\/10.1016\/j.cie.2021.107408","journal-title":"Comput Industr Eng"},{"key":"4479_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.engappai.2020.103541","volume":"90","author":"S Kaur","year":"2020","unstructured":"Kaur S, Awasthi LK, Sangal A et al (2020) Tunicate swarm algorithm: a new bio-inspired based metaheuristic paradigm for global optimization. Eng Appl Artif Intell 90:103\u2013541. https:\/\/doi.org\/10.1016\/j.engappai.2020.103541","journal-title":"Eng Appl Artif Intell"},{"key":"4479_CR37","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.knosys.2022.109215","volume":"251","author":"C Zhong","year":"2022","unstructured":"Zhong C, Li G, Meng Z (2022) Beluga whale optimization: a novel nature-inspired metaheuristic algorithm. Knowl-Based Syst 251:109\u2013215. https:\/\/doi.org\/10.1016\/j.knosys.2022.109215","journal-title":"Knowl-Based Syst"},{"key":"4479_CR38","doi-asserted-by":"publisher","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE congress on evolutionary computation. IEEE. https:\/\/doi.org\/10.1109\/cec.2007.4425083","DOI":"10.1109\/cec.2007.4425083"},{"issue":"3","key":"4479_CR39","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"R Rao","year":"2011","unstructured":"Rao R, Savsani V, Vakharia D (2011) Teaching learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303\u2013315. https:\/\/doi.org\/10.1016\/j.cad.2010.12.015","journal-title":"Comput Aided Des"},{"key":"4479_CR40","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.compstruc.2020.106268","volume":"235","author":"M Jahangiri","year":"2020","unstructured":"Jahangiri M, Hadianfard MA, Najafgholipour MA et al (2020) Interactive autodidactic school: a new metaheuristic optimization algorithm for solving mathematical and structural design optimization problems. Comput Structures 235:106\u2013268. https:\/\/doi.org\/10.1016\/j.compstruc.2020.106268","journal-title":"Comput Structures"},{"issue":"2","key":"4479_CR41","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1007\/s11227-021-03943-w","volume":"78","author":"H Emami","year":"2021","unstructured":"Emami H (2021) Stock exchange trading optimization algorithm: a human-inspired method for global optimization. J Supercomputing 78(2):2125\u20132174. https:\/\/doi.org\/10.1007\/s11227-021-03943-w","journal-title":"J Supercomputing"},{"issue":"4598","key":"4479_CR42","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680. https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"issue":"13","key":"4479_CR43","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248. https:\/\/doi.org\/10.1016\/j.ins.2009.03.004","journal-title":"Inf Sci"},{"key":"4479_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2014.07.025","volume":"75","author":"H Salimi","year":"2015","unstructured":"Salimi H (2015) Stochastic fractal search: a powerful metaheuristic algorithm. Knowl-Based Syst 75:1\u201318. https:\/\/doi.org\/10.1016\/j.knosys.2014.07.025","journal-title":"Knowl-Based Syst"},{"key":"4479_CR45","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) SCA: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133. https:\/\/doi.org\/10.1016\/j.knosys.2015.12.022","journal-title":"Knowl-Based Syst"},{"key":"4479_CR46","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.advengsoft.2017.03.014","volume":"110","author":"A Kaveh","year":"2017","unstructured":"Kaveh A, Dadras A (2017) A novel meta-heuristic optimization algorithm: Thermal exchange optimization. Adv Eng Softw 110:69\u201384. https:\/\/doi.org\/10.1016\/j.advengsoft.2017.03.014","journal-title":"Adv Eng Softw"},{"issue":"4","key":"4479_CR47","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1108\/EC-05-2020-0235","volume":"38","author":"A Kaveh","year":"2020","unstructured":"Kaveh A, Akbari H, Hosseini SM (2020) Plasma generation optimization: a new physically-based metaheuristic algorithm for solving constrained optimization problems. Eng Comput 38(4):1554\u20131606. https:\/\/doi.org\/10.1108\/ec-05-2020-0235","journal-title":"Eng Comput"},{"key":"4479_CR48","doi-asserted-by":"publisher","first-page":"26,231","DOI":"10.1109\/ACCESS.2018.2833552","volume":"6","author":"T Jiang","year":"2018","unstructured":"Jiang T, Zhang C (2018) Application of grey wolf optimization for solving combinatorial problems: job shop and flexible job shop scheduling cases. IEEE Access 6:26,231\u201326,240. https:\/\/doi.org\/10.1109\/access.2018.2833552","journal-title":"IEEE Access"},{"issue":"3","key":"4479_CR49","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s12652-018-0903-3","volume":"10","author":"B Fan","year":"2018","unstructured":"Fan B, Yang W, Zhang Z (2018) Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm. J Ambient Intell Humanized Comput 10(3):979\u2013990. https:\/\/doi.org\/10.1007\/s12652-018-0903-3","journal-title":"J Ambient Intell Humanized Comput"},{"key":"4479_CR50","doi-asserted-by":"publisher","unstructured":"Yu H, Gao Y, Wang L et al (2020) A hybrid particle swarm optimization algorithm enhanced with nonlinear inertial weight and gaussian mutation for job shop scheduling problems. Mathematics 8(8). https:\/\/doi.org\/10.3390\/math8081355","DOI":"10.3390\/math8081355"},{"key":"4479_CR51","doi-asserted-by":"publisher","unstructured":"Liu M, Yao X, Li Y (2020) Hybrid whale optimization algorithm enhanced with l\u00e9vy flight and differential evolution for job shop scheduling problems. Appl Soft Comput, vol 87. https:\/\/doi.org\/10.1016\/j.asoc.2019.105954","DOI":"10.1016\/j.asoc.2019.105954"},{"key":"4479_CR52","doi-asserted-by":"publisher","unstructured":"Li Y, Huang W, Wu R et al (2020) An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput 95. https:\/\/doi.org\/10.1016\/j.asoc.2020.106544","DOI":"10.1016\/j.asoc.2020.106544"},{"key":"4479_CR53","doi-asserted-by":"publisher","unstructured":"Kurdi M (2022) Ant colony optimization with a new exploratory heuristic information approach for open shop scheduling problem. Knowl-Based Syst 242. https:\/\/doi.org\/10.1016\/j.knosys.2022.108323","DOI":"10.1016\/j.knosys.2022.108323"},{"key":"4479_CR54","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.jocs.2022.101636","volume":"61","author":"MH Nadimi-Shahraki","year":"2022","unstructured":"Nadimi-Shahraki MH, Taghian S, Mirjalili S et al (2022) GGWO: gaze cues learning-based grey wolf optimizer and its applications for solving engineering problems. J Computat Sci 61:101\u2013636. https:\/\/doi.org\/10.1016\/j.jocs.2022.101636","journal-title":"J Computat Sci"},{"issue":"2","key":"4479_CR55","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2019.2921598","volume":"24","author":"C Huang","year":"2020","unstructured":"Huang C, Li Y, Yao X (2020) A survey of automatic parameter tuning methods for metaheuristics. IEEE Trans Evol Comput 24(2):201\u2013216. https:\/\/doi.org\/10.1109\/tevc.2019.2921598","journal-title":"IEEE Trans Evol Comput"},{"key":"4479_CR56","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cie.2017.05.026","volume":"110","author":"J Shahrabi","year":"2017","unstructured":"Shahrabi J, Adibi MA, Mahootchi M (2017) A reinforcement learning approach to parameter estimation in dynamic job shop scheduling. Comput Industr Engi 110:75\u201382. https:\/\/doi.org\/10.1016\/j.cie.2017.05.026","journal-title":"Comput Industr Engi"},{"issue":"3","key":"4479_CR57","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TNNLS.2016.2634548","volume":"29","author":"E Emary","year":"2018","unstructured":"Emary E, Zawbaa HM, Grosan C (2018) Experienced gray wolf optimization through reinforcement learning and neural networks. IEEE Trans Neural Netw Learn Syst 29(3):681\u2013694. https:\/\/doi.org\/10.1109\/TNNLS.2016.2634548","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"4479_CR58","doi-asserted-by":"publisher","unstructured":"Zhao F, Zhang L, Cao J et al (2021) A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Comput Industr Eng 153. https:\/\/doi.org\/10.1016\/j.cie.2020.107082","DOI":"10.1016\/j.cie.2020.107082"},{"key":"4479_CR59","doi-asserted-by":"publisher","unstructured":"Chen RH, Yang B, Li S et al (2020) A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Industr Eng 149. https:\/\/doi.org\/10.1016\/j.cie.2020.106778","DOI":"10.1016\/j.cie.2020.106778"},{"issue":"12","key":"4479_CR60","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1631\/FITEE.1900533","volume":"21","author":"H Wang","year":"2020","unstructured":"Wang H, Liu N, Zhang Y et al (2020) Deep reinforcement learning: a survey. Frontiers Inf Technol Electr Eng 21(12):1726\u20131744. https:\/\/doi.org\/10.1631\/fitee.1900533","journal-title":"Frontiers Inf Technol Electr Eng"},{"key":"4479_CR61","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.neunet.2022.05.013","volume":"153","author":"T Rupprecht","year":"2022","unstructured":"Rupprecht T, Wang Y (2022) A survey for deep reinforcement learning in markovian cyber-physical systems: common problems and solutions. Neural Netw 153:13\u201336. https:\/\/doi.org\/10.1016\/j.neunet.2022.05.013","journal-title":"Neural Netw"},{"key":"4479_CR62","doi-asserted-by":"publisher","unstructured":"Xu D, Zhu F, Liu Q et al (2021) Improving exploration efficiency of deep reinforcement learning through samples produced by generative model. Expert Syst Appl 185. https:\/\/doi.org\/10.1016\/j.eswa.2021.115680","DOI":"10.1016\/j.eswa.2021.115680"},{"issue":"4","key":"4479_CR63","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler B, Thompson GL (1960) Algorithms for solving production-scheduling problems. Oper Res 8(4):487\u2013503. https:\/\/doi.org\/10.1287\/opre.8.4.487","journal-title":"Oper Res"},{"issue":"9","key":"4479_CR64","doi-asserted-by":"publisher","first-page":"2604","DOI":"10.1080\/00207543.2019.1622052","volume":"58","author":"F Shi","year":"2019","unstructured":"Shi F, Zhao S, Meng Y (2019) Hybrid algorithm based on improved extended shifting bottleneck procedure and ga for assembly job shop scheduling problem. Int J Prod Res 58(9):2604\u20132625. https:\/\/doi.org\/10.1080\/00207543.2019.1622052","journal-title":"Int J Prod Res"},{"key":"4479_CR65","doi-asserted-by":"publisher","unstructured":"Ge H, Du W, Qian F (2007) A hybrid algorithm based on particle swarm optimization and simulated annealing for job shop scheduling. In: Third international conference on natural computation (ICNC 2007), pp 715\u2013719. https:\/\/doi.org\/10.1109\/ICNC.2007.44","DOI":"10.1109\/ICNC.2007.44"},{"key":"4479_CR66","unstructured":"Fisher H (1963) Probabilistic learning combinations of local job-shop scheduling rules. Industr Sched 225\u2013251"},{"key":"4479_CR67","unstructured":"Lawrence S (1984) Resouce constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate school of industrial administration, Carnegie-Mellon University"},{"key":"4479_CR68","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S (2016) Sca: a sine cosine algorithm for solving optimization problems. Knowl-Based Syst 96:120\u2013133. https:\/\/doi.org\/10.1016\/j.knosys.2015.12.022","journal-title":"Knowl-Based Syst"},{"issue":"11-12","key":"4479_CR69","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1016\/j.mcm.2010.04.019","volume":"52","author":"L Asadzadeh","year":"2010","unstructured":"Asadzadeh L, Zamanifar K (2010) An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Math Comput Model 52(11-12):1957\u20131965. https:\/\/doi.org\/10.1016\/j.mcm.2010.04.019","journal-title":"Math Comput Model"},{"key":"4479_CR70","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.cie.2015.04.006","volume":"85","author":"L Asadzadeh","year":"2015","unstructured":"Asadzadeh L (2015) A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput Industr Eng 85:376\u2013383. https:\/\/doi.org\/10.1016\/j.cie.2015.04.006","journal-title":"Comput Industr Eng"},{"issue":"4","key":"4479_CR71","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1080\/00207543.2015.1041575","volume":"54","author":"F Zhao","year":"2015","unstructured":"Zhao F, Shao Z, Wang J et al (2015) A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems. Int J Prod Res 54(4):1039\u20131060. https:\/\/doi.org\/10.1080\/00207543.2015.1041575","journal-title":"Int J Prod Res"},{"key":"4479_CR72","doi-asserted-by":"publisher","unstructured":"Zhao F, Jiang X, Zhang C et al (2014) A chemotaxis-enhanced bacterial foraging algorithm and its application in job shop scheduling problem. Int J Comput Integr Manuf:1\u201316. https:\/\/doi.org\/10.1080\/0951192x.2014.961962","DOI":"10.1080\/0951192x.2014.961962"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04479-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T07:09:22Z","timestamp":1688713762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04479-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,14]]},"references-count":72,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["4479"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04479-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,14]]},"assertion":[{"value":"19 January 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors confirm that they have complied with the publication ethics and state that this work is original and has not been used for publication anywhere before.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors give consent to the journal regarding the publication of this work.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Consent for Publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}