{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T22:58:24Z","timestamp":1771455504942,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T00:00:00Z","timestamp":1748995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T00:00:00Z","timestamp":1748995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"The Two Zones","award":["2023LQ02004"],"award-info":[{"award-number":["2023LQ02004"]}]},{"name":"the National Key Research and Development Program of China","award":["Grant NO. 2024YFD2400200\uff1b2024YFD2400204"],"award-info":[{"award-number":["Grant NO. 2024YFD2400200\uff1b2024YFD2400204"]}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["DUT24BK046"],"award-info":[{"award-number":["DUT24BK046"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s40747-025-01890-0","type":"journal-article","created":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:09:28Z","timestamp":1749010168000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel two stage neighborhood search for flexible job shop scheduling problem considering reconfigurable machine tools"],"prefix":"10.1007","volume":"11","author":[{"given":"Yanjun","family":"Shi","sequence":"first","affiliation":[]},{"given":"Chengjia","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Shiduo","family":"Ning","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"issue":"21","key":"1890_CR1","doi-asserted-by":"publisher","first-page":"6400","DOI":"10.1080\/00207543.2020.1813913","volume":"59","author":"AR Yelles-Chaouche","year":"2021","unstructured":"Yelles-Chaouche AR, Gurevsky E, Brahimi N et al (2021) Reconfigurable manufacturing systems from an optimisation perspective: a focused review of literature. Int J Prod Res 59(21):6400\u20136418. https:\/\/doi.org\/10.1080\/00207543.2020.1813913","journal-title":"Int J Prod Res"},{"key":"1890_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106416","volume":"94","author":"M Mahmoodjanloo","year":"2020","unstructured":"Mahmoodjanloo M, Tavakkoli-Moghaddam R, Baboli A et al (2020) Flexible job shop scheduling problem with reconfigurable machine tools: An improved differential evolution algorithm. Appl Soft Comput 94:106416. https:\/\/doi.org\/10.1016\/j.asoc.2020.106416","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1890_CR3","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/S0007-8506(07)63232-6","volume":"48","author":"Y Koren","year":"1999","unstructured":"Koren Y, Heisel U, Jovane F et al (1999) Reconfigurable manufacturing systems. CIRP Ann 48(2):527\u2013540. https:\/\/doi.org\/10.1016\/S0007-8506(07)63232-6","journal-title":"CIRP Ann"},{"key":"1890_CR4","doi-asserted-by":"publisher","unstructured":"Ersal T, Stein JL, Louca LS (2004) A modular modeling approach for the design of reconfigurable machine tools[C] , Anaheim, CA, United states. American Society of Mechanical Engineers. https:\/\/doi.org\/10.1115\/IMECE2004-59806","DOI":"10.1115\/IMECE2004-59806"},{"issue":"3","key":"1890_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1115\/1.4025405","volume":"136","author":"R Perez","year":"2014","unstructured":"Perez R, Molina A, Ramirez-Cadena M (2014) Development of an integrated approach to the design of reconfigurable micro\/mesoscale CNC machine tools. J Manuf Sci Eng-Trans Asme 136(3):10. https:\/\/doi.org\/10.1115\/1.4025405","journal-title":"J Manuf Sci Eng-Trans Asme"},{"issue":"2","key":"1890_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.jmsy.2011.10.003","volume":"31","author":"J Padayachee","year":"2012","unstructured":"Padayachee J, Bright G (2012) Modular machine tools: design and barriers to industrial implementation. J Manuf Syst 31(2):92\u2013102. https:\/\/doi.org\/10.1016\/j.jmsy.2011.10.003","journal-title":"J Manuf Syst"},{"key":"1890_CR7","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1016\/j.proeng.2013.09.217","volume":"64","author":"F Hasan","year":"2013","unstructured":"Hasan F, Jain PK, Kumar D (2013) Machine reconfigurability models using multi-attribute utility theory and power function approximation. Proc Eng 64:1354\u20131363. https:\/\/doi.org\/10.1016\/j.proeng.2013.09.217","journal-title":"Proc Eng"},{"issue":"3","key":"1890_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.jmsy.2012.02.003","volume":"31","author":"C Liu","year":"2012","unstructured":"Liu C, Li W, Lian J et al (2012) Reconfiguration of assembly systems: from conveyor assembly line to serus. J Manuf Syst 31(3):312\u2013325. https:\/\/doi.org\/10.1016\/j.jmsy.2012.02.003","journal-title":"J Manuf Syst"},{"issue":"12","key":"1890_CR9","doi-asserted-by":"publisher","first-page":"3583","DOI":"10.1080\/00207543.2013.878056","volume":"52","author":"A Bensmaine","year":"2014","unstructured":"Bensmaine A, Dahane M, Benyoucef L (2014) A new heuristic for integrated process planning and scheduling in reconfigurable manufacturing systems. Int J Prod Res 52(12):3583\u20133594. https:\/\/doi.org\/10.1080\/00207543.2013.878056","journal-title":"Int J Prod Res"},{"key":"1890_CR10","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.jmsy.2024.03.009","volume":"74","author":"H Guo","year":"2024","unstructured":"Guo H, Liu J, Wang Y et al (2024) An improved genetic programming hyper-heuristic for the dynamic flexible job shop scheduling problem with reconfigurable manufacturing cells. J Manuf Syst 74:252\u2013263. https:\/\/doi.org\/10.1016\/j.jmsy.2024.03.009","journal-title":"J Manuf Syst"},{"key":"1890_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.112148","author":"Y Hu","year":"2024","unstructured":"Hu Y, Zhang L, Zhang Z et al (2024) Flexible assembly job shop scheduling problem considering reconfigurable machine: a cooperative co-evolutionary matheuristic algorithm. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2024.112148","journal-title":"Appl Soft Comput"},{"key":"1890_CR12","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.jmsy.2021.01.001","volume":"58","author":"M Bortolini","year":"2021","unstructured":"Bortolini M, Ferrari E, Galizia FG et al (2021) An optimisation model for the dynamic management of cellular reconfigurable manufacturing systems under auxiliary module availability constraints. J J Manuf Syst 58:442\u2013451. https:\/\/doi.org\/10.1016\/j.jmsy.2021.01.001","journal-title":"J J Manuf Syst"},{"issue":"16","key":"1890_CR13","doi-asserted-by":"publisher","first-page":"4973","DOI":"10.1080\/00207543.2021.1946193","volume":"60","author":"M Mahmoodjanloo","year":"2022","unstructured":"Mahmoodjanloo M, Tavakkoli-Moghaddama R, Baboli A et al (2022) Distributed job - shop rescheduling problem considering reconfigurability of machines: a self-adaptive hybrid equilibrium optimiser. Int J Prod Res 60(16):4973\u20134994. https:\/\/doi.org\/10.1080\/00207543.2021.1946193","journal-title":"Int J Prod Res"},{"key":"1890_CR14","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.jmsy.2022.01.014","volume":"62","author":"J Fan","year":"2022","unstructured":"Fan J, Zhang C, Liu Q et al (2022) An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules. J Manuf Syst 62:650\u2013667. https:\/\/doi.org\/10.1016\/j.jmsy.2022.01.014","journal-title":"J Manuf Syst"},{"issue":"19","key":"1890_CR15","doi-asserted-by":"publisher","first-page":"6565","DOI":"10.1080\/00207543.2022.2135629","volume":"61","author":"J Fan","year":"2023","unstructured":"Fan J, Zhang C, Shen W et al (2023) A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations. Int J Prod Res 61(19):6565\u20136588. https:\/\/doi.org\/10.1080\/00207543.2022.2135629","journal-title":"Int J Prod Res"},{"issue":"7","key":"1890_CR16","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 et al (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":"1890_CR17","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.jmsy.2024.02.007","volume":"73","author":"Y Xu","year":"2024","unstructured":"Xu Y, Zhang M, Yang M et al (2024) Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem. J Manuf Syst 73:334\u2013348. https:\/\/doi.org\/10.1016\/j.jmsy.2024.02.007","journal-title":"J Manuf Syst"},{"key":"1890_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101419","author":"S Cao","year":"2023","unstructured":"Cao S, Li R, Gong W et al (2023) Inverse model and adaptive neighborhood search based cooperative optimizer for energy-efficient distributed flexible job shop scheduling. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2023.101419","journal-title":"Swarm Evol Comput"},{"key":"1890_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107762","author":"K Huang","year":"2024","unstructured":"Huang K, Gong W, Lu C (2024) An enhanced memetic algorithm with hierarchical heuristic neighborhood search for type-2 green fuzzy flexible job shop scheduling. Eng Appl Artif Intell. https:\/\/doi.org\/10.1016\/j.engappai.2023.107762","journal-title":"Eng Appl Artif Intell"},{"key":"1890_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101753","author":"Q Zhang","year":"2024","unstructured":"Zhang Q, Shao W, Shao Z et al (2024) Deep reinforcement learning driven trajectory-based meta-heuristic for distributed heterogeneous flexible job shop scheduling problem. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2024.101753","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"1890_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2022.322279","volume":"27","author":"J Ding","year":"2023","unstructured":"Ding J, Dauzere-Peres S, Shen L et al (2023) A novel evolutionary algorithm for energy efficient scheduling in flexible job shops. IEEE Trans Evol Comput 27(5):1. https:\/\/doi.org\/10.1109\/TEVC.2022.322279","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1890_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M Mastrolilli","year":"2000","unstructured":"Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3(1):3\u201320. https:\/\/doi.org\/10.1002\/(SICI)1099-1425(200001\/02)3:1%3c3::AID-JOS32%3e3.0.CO;2-Y","journal-title":"J Sched"},{"issue":"3","key":"1890_CR23","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi P, Saidi Mehrabad M, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331\u2013342. https:\/\/doi.org\/10.1007\/s10845-007-0026-8","journal-title":"J Intell Manuf"},{"issue":"3","key":"1890_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41(3):157\u2013183. https:\/\/doi.org\/10.1007\/BF02023073","journal-title":"Ann Oper Res"},{"key":"1890_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106347","volume":"142","author":"L Meng","year":"2020","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 Ind Eng 142:106347","journal-title":"Comput Ind Eng"},{"key":"1890_CR26","first-page":"66","volume-title":"Genetic algorithms","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Genetic algorithms, vol 267. Scientific American, Incorporated, New York, pp 66\u201373"},{"issue":"1\/2","key":"1890_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\/2):81. https:\/\/doi.org\/10.2307\/2332226","journal-title":"Biometrika"},{"issue":"20","key":"1890_CR28","doi-asserted-by":"publisher","first-page":"419A","DOI":"10.1021\/es053368a","volume":"39","author":"DR Helsel","year":"2005","unstructured":"Helsel DR (2005) More than obvious: better methods for interpreting nondetect data. Environ Sci Technol 39(20):419A-423A. https:\/\/doi.org\/10.1021\/es053368a","journal-title":"Environ Sci Technol"},{"issue":"1","key":"1890_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10951-013-0316-2","volume":"16","author":"E Burke","year":"2013","unstructured":"Burke E, Pinedo M (2013) Journal of Scheduling (2013). J Sched 16(1):1\u20132. https:\/\/doi.org\/10.1007\/s10951-013-0316-2","journal-title":"J Sched"},{"issue":"15","key":"1890_CR30","doi-asserted-by":"publisher","first-page":"4743","DOI":"10.1080\/00207543.2021.1937745","volume":"60","author":"D M\u00fcller","year":"2022","unstructured":"M\u00fcller D, Kress D (2022) Filter-and-fan approaches for scheduling flexible job shops under workforce constraints. Int J Prod Res 60(15):4743\u20134765. https:\/\/doi.org\/10.1080\/00207543.2021.1937745","journal-title":"Int J Prod Res"},{"issue":"17","key":"1890_CR31","doi-asserted-by":"publisher","first-page":"3643","DOI":"10.1016\/j.dam.2009.02.020","volume":"157","author":"H Gr\u00f6flin","year":"2009","unstructured":"Gr\u00f6flin H, Klinkert A (2009) A new neighborhood and tabu search for the Blocking Job Shop. Discret Appl Math 157(17):3643\u20133655. https:\/\/doi.org\/10.1016\/j.dam.2009.02.020","journal-title":"Discret Appl Math"},{"key":"1890_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101204","volume":"75","author":"H Lou","year":"2022","unstructured":"Lou H, Wang X, Dong Z et al (2022) Memetic algorithm based on learning and decomposition for multiobjective flexible job shop scheduling considering human factors. Swarm Evol Comput 75:101204. https:\/\/doi.org\/10.1016\/j.swevo.2022.101204","journal-title":"Swarm Evol Comput"},{"issue":"Suppl 5","key":"1890_CR33","doi-asserted-by":"publisher","first-page":"11561","DOI":"10.1007\/s10586-017-1420-4","volume":"22","author":"G Zhang","year":"2019","unstructured":"Zhang G, Zhang L, Song X et al (2019) A variable neighborhood search based genetic algorithm for flexible job shop scheduling problem. Clust Comput 22(Suppl 5):11561\u201311572. https:\/\/doi.org\/10.1007\/s10586-017-1420-4","journal-title":"Clust Comput"},{"key":"1890_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101058","volume":"71","author":"L Meng","year":"2022","unstructured":"Meng L, Gao K, Ren Y et al (2022) Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 71:101058. https:\/\/doi.org\/10.1016\/j.swevo.2022.101058","journal-title":"Swarm Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01890-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01890-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-01890-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T11:08:36Z","timestamp":1750331316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01890-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,4]]},"references-count":34,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1890"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01890-0","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,4]]},"assertion":[{"value":"9 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 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":"312"}}