{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T05:40:01Z","timestamp":1756618801350,"version":"3.44.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s40747-025-02026-0","type":"journal-article","created":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T07:06:09Z","timestamp":1754031969000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A hybrid genetic tabu search algorithm based on a multi-operation joint movement neighborhood structure for job shop scheduling problems"],"prefix":"10.1007","volume":"11","author":[{"given":"Lei","family":"Wang","sequence":"first","affiliation":[]},{"given":"Kongfu","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Jingcao","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Long","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Jiawei","family":"Ren","sequence":"additional","affiliation":[]},{"given":"Qiangqiang","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"issue":"3","key":"2026_CR1","doi-asserted-by":"publisher","first-page":"5937","DOI":"10.1109\/LRA.2021.3086422","volume":"6","author":"A Liu","year":"2021","unstructured":"Liu A, Luh PB, Yan B, Bragin MA (2021) A novel integer linear programming formulation for job-shop scheduling problems. IEEE Robot Autom Lett 6(3):5937\u20135944. https:\/\/doi.org\/10.1109\/LRA.2021.3086422","journal-title":"IEEE Robot Autom Lett"},{"key":"2026_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102506","volume":"81","author":"Y-J Yao","year":"2023","unstructured":"Yao Y-J, Liu Q-H, Li X-Y, Gao L (2023) A novel milp model for job shop scheduling problem with mobile robots. Robot Comput-Integr Manuf 81:102506. https:\/\/doi.org\/10.1016\/j.rcim.2022.102506","journal-title":"Robot Comput-Integr Manuf"},{"key":"2026_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Zhao W, Wang Y, Qian L, Meng X, Tang L (2022) A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Syst Appl 205:117796. https:\/\/doi.org\/10.1016\/j.eswa.2022.117796","journal-title":"Expert Syst Appl"},{"key":"2026_CR4","doi-asserted-by":"publisher","DOI":"10.1145\/3459664","author":"E-G Talbi","year":"2021","unstructured":"Talbi E-G (2021) Machine learning into metaheuristics: A survey and taxonomy. ACM Comput Surv. https:\/\/doi.org\/10.1145\/3459664","journal-title":"ACM Comput Surv"},{"key":"2026_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106778","volume":"149","author":"R Chen","year":"2020","unstructured":"Chen R, Yang B, Li S, Wang S (2020) A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Ind Eng 149:106778. https:\/\/doi.org\/10.1016\/j.cie.2020.106778","journal-title":"Comput Ind Eng"},{"key":"2026_CR6","doi-asserted-by":"publisher","DOI":"10.3390\/app12052285","author":"MM Rosso","year":"2022","unstructured":"Rosso MM, Cucuzza R, Aloisio A, Marano GC (2022) Enhanced multi-strategy particle swarm optimization for constrained problems with an evolutionary-strategies-based unfeasible local search operator. Appl Sci. https:\/\/doi.org\/10.3390\/app12052285","journal-title":"Appl Sci"},{"issue":"2","key":"2026_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","volume":"200","author":"LD Giovanni","year":"2010","unstructured":"Giovanni LD, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res 200(2):395\u2013408. https:\/\/doi.org\/10.1016\/j.ejor.2009.01.008","journal-title":"Eur J Oper Res"},{"key":"2026_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.2507\/IJSIMM20-1-CO5","volume":"20","author":"F Wei","year":"2021","unstructured":"Wei F, Cao C, Zhang H (2021) An improved genetic algorithm for resource-constrained flexible job-shop scheduling. Int J Simul Model 20:201\u2013211. https:\/\/doi.org\/10.2507\/IJSIMM20-1-CO5","journal-title":"Int J Simul Model"},{"issue":"1","key":"2026_CR9","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1016\/j.eswa.2011.08.008","volume":"39","author":"C-W Chiou","year":"2012","unstructured":"Chiou C-W, Chen W-M, Liu C-M, Wu M-C (2012) A genetic algorithm for scheduling dual flow shops. Expert Syst Appl 39(1):1306\u20131314. https:\/\/doi.org\/10.1016\/j.eswa.2011.08.008","journal-title":"Expert Syst Appl"},{"issue":"9","key":"2026_CR10","doi-asserted-by":"publisher","first-page":"168781401880144","DOI":"10.1177\/1687814018801442","volume":"10","author":"X Huang","year":"2018","unstructured":"Huang X, Guan Z, Yang L (2018) An effective hybrid algorithm for multi-objective flexible job-shop scheduling problem. Adv Mech Eng 10(9):1687814018801442. https:\/\/doi.org\/10.1177\/1687814018801442","journal-title":"Adv Mech Eng"},{"issue":"1","key":"2026_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ijpe.2010.08.004","volume":"129","author":"G Moslehi","year":"2011","unstructured":"Moslehi G, Mahnam M (2011) A pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int J Prod Econ 129(1):14\u201322. https:\/\/doi.org\/10.1016\/j.ijpe.2010.08.004","journal-title":"Int J Prod Econ"},{"issue":"2","key":"2026_CR12","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.eswa.2009.06.041","volume":"37","author":"DY Sha","year":"2010","unstructured":"Sha DY, Lin H-H (2010) A multi-objective pso for job-shop scheduling problems. Expert Syst Appl 37(2):1065\u20131070. https:\/\/doi.org\/10.1016\/j.eswa.2009.06.041","journal-title":"Expert Syst Appl"},{"issue":"3","key":"2026_CR13","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","volume":"10","author":"L-N Xing","year":"2010","unstructured":"Xing L-N, Chen Y-W, Wang P, Zhao Q-S, Xiong J (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10(3):888\u2013896. https:\/\/doi.org\/10.1016\/j.asoc.2009.10.006","journal-title":"Appl Soft Comput"},{"issue":"4","key":"2026_CR14","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/00207540802538021","volume":"48","author":"M Seo","year":"2010","unstructured":"Seo M, Kim D (2010) Ant colony optimisation with parameterised search space for the job shop scheduling problem. Int J Prod Res 48(4):1143\u20131154. https:\/\/doi.org\/10.1080\/00207540802538021","journal-title":"Int J Prod Res"},{"key":"2026_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10845-015-1091-z","volume":"29","author":"B Zhao","year":"2018","unstructured":"Zhao B, Gao J, Chen K, Guo K (2018) Two-generation pareto ant colony algorithm for multi-objective job shop scheduling problem with alternative process plans and unrelated parallel machines. J Intell Manuf 29:1\u201316. https:\/\/doi.org\/10.1007\/s10845-015-1091-z","journal-title":"J Intell Manuf"},{"key":"2026_CR16","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1111\/itor.12195","volume":"24","author":"M Mart\u00ednez-Rangel","year":"2017","unstructured":"Mart\u00ednez-Rangel M, Cruz Ch\u00e1vez M, Cruz-Rosales M (2017) Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem. Int Trans Oper Res 24:1119\u20131137. https:\/\/doi.org\/10.1111\/itor.12195","journal-title":"Int Trans Oper Res"},{"issue":"5","key":"2026_CR17","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TFUZZ.2018.2879789","volume":"27","author":"B Wang","year":"2019","unstructured":"Wang B, Xie H, Xia X, Zhang X (2019) A nsga-ii algorithm hybridizing local simulated-annealing operators for a bi-criteria robust job-shop scheduling problem under scenarios. IEEE Trans Fuzzy Syst 27(5):1075\u20131084. https:\/\/doi.org\/10.1109\/TFUZZ.2018.2879789","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"2026_CR18","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2012.750771","author":"B Vahedi Nouri","year":"2013","unstructured":"Vahedi Nouri B, Fattahi P, Ramezanian R (2013) Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2012.750771","journal-title":"Int J Prod Res"},{"issue":"4","key":"2026_CR19","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.cie.2011.12.018","volume":"62","author":"MM Nasiri","year":"2012","unstructured":"Nasiri MM, Kianfar F (2012) A ges\/ts algorithm for the job shop scheduling. Comput Ind Eng 62(4):946\u2013952. https:\/\/doi.org\/10.1016\/j.cie.2011.12.018","journal-title":"Comput Ind Eng"},{"issue":"4","key":"2026_CR20","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.cie.2012.01.003","volume":"62","author":"D Prot","year":"2012","unstructured":"Prot D, Bellenguez-Morineau O (2012) Tabu search and lower bound for an industrial complex shop scheduling problem. Comput Ind Eng 62(4):1109\u20131118. https:\/\/doi.org\/10.1016\/j.cie.2012.01.003","journal-title":"Comput Ind Eng"},{"issue":"23","key":"2026_CR21","doi-asserted-by":"publisher","first-page":"6963","DOI":"10.1080\/00207543.2010.526016","volume":"49","author":"G Vilcot","year":"2011","unstructured":"Vilcot G, Billaut J-C (2011) A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem. Int J Prod Res 49(23):6963\u20136980. https:\/\/doi.org\/10.1080\/00207543.2010.526016","journal-title":"Int J Prod Res"},{"key":"2026_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.cie.2015.04.029","volume":"87","author":"B Liu","year":"2015","unstructured":"Liu B, Fan Y, Liu Y (2015) A fast estimation of distribution algorithm for dynamic fuzzy flexible job-shop scheduling problem. Comput Ind Eng 87:193\u2013201. https:\/\/doi.org\/10.1016\/j.cie.2015.04.029","journal-title":"Comput Ind Eng"},{"key":"2026_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100861","volume":"62","author":"Y Du","year":"2021","unstructured":"Du Y, Li J-Q, Luo C (2021) A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations. Swarm Evol Comput 62:100861. https:\/\/doi.org\/10.1016\/j.swevo.2021.100861","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"2026_CR24","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1016\/j.eswa.2009.08.015","volume":"37","author":"T-L Lin","year":"2010","unstructured":"Lin T-L, Horng S-J, Kao T-W, Chen Y-H, Run R-S, Chen R-J, Lai J-L, Kuo I-H (2010) An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl 37(3):2629\u20132636. https:\/\/doi.org\/10.1016\/j.eswa.2009.08.015","journal-title":"Expert Syst Appl"},{"key":"2026_CR25","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93\u2013110. https:\/\/doi.org\/10.1016\/j.ijpe.2016.01.016","journal-title":"Int J Prod Econ"},{"key":"2026_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-015-1084-y","author":"H-C Chang","year":"2015","unstructured":"Chang H-C, Liu T-K (2015) Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-015-1084-y","journal-title":"J Intell Manuf"},{"issue":"5","key":"2026_CR27","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1109\/TFUZZ.2019.2895562","volume":"27","author":"L Sun","year":"2019","unstructured":"Sun L, Lin L, Gen M, Li H (2019) A hybrid cooperative coevolution algorithm for fuzzy flexible job shop scheduling. IEEE Trans Fuzzy Syst 27(5):1008\u20131022. https:\/\/doi.org\/10.1109\/TFUZZ.2019.2895562","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"1","key":"2026_CR28","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.asoc.2009.06.008","volume":"10","author":"R Zhang","year":"2010","unstructured":"Zhang R, Wu C (2010) A hybrid immune simulated annealing algorithm for the job shop scheduling problem. Appl Soft Comput 10(1):79\u201389. https:\/\/doi.org\/10.1016\/j.asoc.2009.06.008","journal-title":"Appl Soft Comput"},{"key":"2026_CR29","doi-asserted-by":"publisher","first-page":"127090","DOI":"10.1109\/ACCESS.2019.2938773","volume":"7","author":"W Chen","year":"2019","unstructured":"Chen W, Yang H, Hao Y (2019) Scheduling of dynamic multi-objective flexible enterprise job-shop problem based on hybrid qpso. IEEE Access 7:127090\u2013127097. https:\/\/doi.org\/10.1109\/ACCESS.2019.2938773","journal-title":"IEEE Access"},{"issue":"2","key":"2026_CR30","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1111\/itor.12044","volume":"21","author":"JF Gon\u00e7alves","year":"2014","unstructured":"Gon\u00e7alves JF, Resende M (2014) An extended akers graphical method with a biased random-key genetic algorithm for job-shop scheduling. Int Trans Oper Res 21(2):215\u2013246. https:\/\/doi.org\/10.1111\/itor.12044","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"2026_CR31","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P Laarhoven","year":"1992","unstructured":"Laarhoven P, Aarts E, Lenstra JK (1992) Job shop scheduling by simulated annealing. Oper Res Int J 40(2):113\u2013125. https:\/\/doi.org\/10.1287\/opre.40.1.113","journal-title":"Oper Res Int J"},{"key":"2026_CR32","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF02022094","volume":"21","author":"H Matsuo","year":"1990","unstructured":"Matsuo H, Suh CJ, Sullivan RS (1990) A controlled search simulated annealing method for the single machine weighted tardiness problem. Ann Oper Res 21:85\u2013108. https:\/\/doi.org\/10.1007\/BF02022094","journal-title":"Ann Oper Res"},{"key":"2026_CR33","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico M, Trubian M (1993) Applying tabu search to the job-shop scheduling problem. Ann Oper Res 41:231\u2013252. https:\/\/doi.org\/10.1007\/BF02023076","journal-title":"Ann Oper Res"},{"key":"2026_CR34","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/MNSC.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42:797\u2013813. https:\/\/doi.org\/10.1287\/MNSC.42.6.797","journal-title":"Manage Sci"},{"key":"2026_CR35","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E Balas","year":"1998","unstructured":"Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44:262\u2013275. https:\/\/doi.org\/10.1287\/mnsc.44.2.262","journal-title":"Manage Sci"},{"issue":"11","key":"2026_CR36","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"C Zhang","year":"2007","unstructured":"Zhang C, Li P, Guan Z, Rao Y (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res 34(11):3229\u20133242. https:\/\/doi.org\/10.1016\/j.cor.2005.12.002","journal-title":"Comput Oper Res"},{"issue":"7","key":"2026_CR37","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1080\/00207543.2022.2060772","volume":"61","author":"J Xie","year":"2023","unstructured":"Xie J, Li X, Gao L, Gui L (2023) A new neighbourhood structure for job shop scheduling problems. Int J Prod Res 61(7):2147\u20132161. https:\/\/doi.org\/10.1080\/00207543.2022.2060772","journal-title":"Int J Prod Res"},{"key":"2026_CR38","doi-asserted-by":"publisher","first-page":"318","DOI":"10.3901\/JME.2023.04.318","volume":"59","author":"LJ Zhao Shikui","year":"2023","unstructured":"Zhao Shikui LJ, Huang L (2023) Research on strengthening multi-operation joint movement neighborhood structure and approximate evaluation of job shop scheduling problem. J Mech Eng 59:318\u2013331. https:\/\/doi.org\/10.3901\/JME.2023.04.318","journal-title":"J Mech Eng"},{"key":"2026_CR39","unstructured":"Zhiyong B, Yiping Y, Guoqing P, Bo W (2023) Hybrid evolutionary algorithm with multi-operation precise joint movement neighborhood structure for the job shop scheduling problem. Comput Integr Manuf Syst"},{"key":"2026_CR40","doi-asserted-by":"publisher","first-page":"192","DOI":"10.3901\/jme.2020.13.192","volume":"56","author":"Z Shikui","year":"2020","unstructured":"Shikui Z (2020) Research on multi-operation joint movement neighborhood structure of job shop scheduling problem. J Mech Eng 56:192. https:\/\/doi.org\/10.3901\/jme.2020.13.192","journal-title":"J Mech Eng"},{"key":"2026_CR41","first-page":"83","volume":"23","author":"Z Chaoyong","year":"2004","unstructured":"Chaoyong Z, Yunqing R, Xiangjun L, Peigen L (2004) An improved genetic algorithm for the job shop scheduling problem. China Mech Eng 23:83\u201387","journal-title":"China Mech Eng"},{"key":"2026_CR42","doi-asserted-by":"publisher","first-page":"17407","DOI":"10.3934\/mbe.2023774","volume":"20","author":"K Hu","year":"2023","unstructured":"Hu K, Wang L, Cai J, Cheng L (2023) An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem. Math Biosci Eng 20:17407\u201317427. https:\/\/doi.org\/10.3934\/mbe.2023774","journal-title":"Math Biosci Eng"},{"key":"2026_CR43","unstructured":"Industrial Scheduling. Prentice-Hall (1963)"},{"key":"2026_CR44","doi-asserted-by":"publisher","unstructured":"Lawrence S (1984). Supplement to resource constrained project scheduling An experimental investigation of heuristic scheduling techniques. https:\/\/doi.org\/10.1016\/j.egypro.2011.02.394","DOI":"10.1016\/j.egypro.2011.02.394"},{"issue":"3","key":"2026_CR45","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34(3):391\u2013401. https:\/\/doi.org\/10.1287\/mnsc.34.3.391","journal-title":"Manage Sci"},{"issue":"2","key":"2026_CR46","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. INFORMS J Comput 3(2):149\u2013156. https:\/\/doi.org\/10.1287\/ijoc.3.2.149","journal-title":"INFORMS J Comput"},{"issue":"2","key":"2026_CR47","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285. https:\/\/doi.org\/10.1016\/0377-2217(93)90182. (-M. Project Management anf Scheduling)","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2026_CR48","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol E, Mehta S, Uzsoy R (1998) Benchmarks for shop scheduling problems. Eur J Oper Res 109(1):137\u2013141. https:\/\/doi.org\/10.1016\/S0377-2217(97)00019-2","journal-title":"Eur J Oper Res"},{"key":"2026_CR49","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.jmsy.2023.09.002","volume":"71","author":"J Xie","year":"2023","unstructured":"Xie J, Li X, Gao L, Gui L (2023) A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems. J Manuf Syst 71:82\u201394. https:\/\/doi.org\/10.1016\/j.jmsy.2023.09.002","journal-title":"J Manuf Syst"},{"key":"2026_CR50","doi-asserted-by":"publisher","unstructured":"Sha DY, Hsu C-Y (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51(4):791\u2013808. https:\/\/doi.org\/10.1016\/j.cie.2006.09.002","DOI":"10.1016\/j.cie.2006.09.002"},{"issue":"10","key":"2026_CR51","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","volume":"39","author":"R Qing-dao-er-ji","year":"2012","unstructured":"Qing-dao-er-ji R, Wang Y (2012) A new hybrid genetic algorithm for job shop scheduling problem. Comput Oper Res 39(10):2291\u20132299. https:\/\/doi.org\/10.1016\/j.cor.2011.12.005","journal-title":"Comput Oper Res"},{"key":"2026_CR52","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng B, L\u00fc Z, Cheng T (2015) A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Comput Oper Res 53:154\u2013164. https:\/\/doi.org\/10.1016\/j.cor.2014.08.006","journal-title":"Comput Oper Res"},{"key":"2026_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110436","volume":"143","author":"E Yuan","year":"2023","unstructured":"Yuan E, Cheng S, Wang L, Song S, Wu F (2023) Solving job shop scheduling problems via deep reinforcement learning. Appl Soft Comput 143:110436. https:\/\/doi.org\/10.1016\/j.asoc.2023.110436","journal-title":"Appl Soft Comput"},{"issue":"1","key":"2026_CR54","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast ts\/sa algorithm for the job shop scheduling problem. Comput Oper Res 35(1):282\u2013294. https:\/\/doi.org\/10.1016\/j.cor.2006.02.024. (Part Special Issue: Applications of OR in Finance)","journal-title":"Comput Oper Res"},{"issue":"2","key":"2026_CR55","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"N Eugeniusz","year":"2005","unstructured":"Eugeniusz N, Czes\u0142aw S (2005) An advanced tabu search algorithm for the job shop problem. J Sched 8(2):145\u2013159. https:\/\/doi.org\/10.1007\/s10951-005-6364-5","journal-title":"J Sched"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02026-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-02026-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02026-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T05:26:54Z","timestamp":1756618014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-02026-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"references-count":55,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2026"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-02026-0","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"3 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"408"}}