{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:57:13Z","timestamp":1783184233867,"version":"3.54.6"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s12351-025-00977-3","type":"journal-article","created":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T18:28:14Z","timestamp":1758738494000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Panoptic migrating birds optimization with GCN-guided population iteration: a feature-guided intelligent optimizer (FGIO) for flexible job shop scheduling"],"prefix":"10.1007","volume":"25","author":[{"given":"Ze","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5036-3756","authenticated-orcid":false,"given":"Mingyan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongfeng","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,24]]},"reference":[{"issue":"2","key":"977_CR1","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/s11750-024-00669-9","volume":"32","author":"FSD Almeida","year":"2024","unstructured":"Almeida FSD, Nagano MS (2024) An alns to optimize makespan subject to total completion time for no-wait flow shops with sequence-dependent setup times. TOP 32(2):304\u2013322","journal-title":"TOP"},{"issue":"1","key":"977_CR2","doi-asserted-by":"publisher","first-page":"6628889","DOI":"10.1155\/2021\/6628889","volume":"2021","author":"WH Bangyal","year":"2021","unstructured":"Bangyal WH, Hameed A, Alosaimi W et al (2021) A new initialization approach in particle swarm optimization for global optimization problems. Comput Intell Neurosci 2021(1):6628889","journal-title":"Comput Intell Neurosci"},{"key":"977_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107542","volume":"160","author":"V Boyer","year":"2021","unstructured":"Boyer V, Vallikavungal J, Rodr\u00edguez XC et al (2021) The generalized flexible job shop scheduling problem. Comput Ind Eng 160:107542","journal-title":"Comput Ind Eng"},{"issue":"1","key":"977_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-023-05499-9","volume":"333","author":"MA Bragin","year":"2024","unstructured":"Bragin MA (2024) Survey on lagrangian relaxation for milp: importance, challenges, historical review, recent advancements, and opportunities. Ann Oper Res 333(1):29\u201345","journal-title":"Ann Oper Res"},{"issue":"4","key":"977_CR5","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/s10489-025-06322-7","volume":"55","author":"Z Chen","year":"2025","unstructured":"Chen Z, Chen W, Yao J et al (2025) Deep random walk inspired multi-view graph convolutional networks for semi-supervised classification. Appl Intell 55(4):428","journal-title":"Appl Intell"},{"issue":"2","key":"977_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","volume":"314","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Ding J, Shen L et al (2024) The flexible job shop scheduling problem: a review. Eur J Oper Res 314(2):409\u2013432","journal-title":"Eur J Oper Res"},{"key":"977_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.cirpj.2021.03.006","volume":"33","author":"B Denkena","year":"2021","unstructured":"Denkena B, Schinkel F, Pirnay J et al (2021) Quantum algorithms for process parallel flexible job shop scheduling. CIRP J Manuf Sci Technol 33:100\u2013114","journal-title":"CIRP J Manuf Sci Technol"},{"key":"977_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ins.2012.06.032","volume":"217","author":"E Duman","year":"2012","unstructured":"Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65\u201377","journal-title":"Inf Sci"},{"issue":"1","key":"977_CR9","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TNNLS.2022.3172588","volume":"35","author":"J Gan","year":"2022","unstructured":"Gan J, Hu R, Mo Y et al (2022) Multigraph fusion for dynamic graph convolutional network. IEEE Trans Neural Netw Learn Syst 35(1):196\u2013207","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"4","key":"977_CR10","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 Autom Sin 6(4):904\u2013916","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"977_CR11","doi-asserted-by":"publisher","first-page":"33125","DOI":"10.1109\/ACCESS.2020.2974014","volume":"8","author":"XL Gu","year":"2020","unstructured":"Gu XL, Huang M, Liang X (2020) A discrete particle swarm optimization algorithm with adaptive inertia weight for solving multiobjective flexible job-shop scheduling problem. IEEE Access 8:33125\u201333136","journal-title":"IEEE Access"},{"key":"977_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.110095","volume":"190","author":"MH Jabeur","year":"2024","unstructured":"Jabeur MH et al (2024) Optimizing integrated lot sizing and production scheduling in flexible flow line systems with energy scheme: a two level approach based on reinforcement learning. Comput Ind Eng 190:110095","journal-title":"Comput Ind Eng"},{"key":"977_CR13","doi-asserted-by":"publisher","first-page":"106156","DOI":"10.1016\/j.cor.2023.106156","volume":"152","author":"C Juvin","year":"2023","unstructured":"Juvin C, Houssin L, Lopez P (2023) Logic-based benders decomposition for the preemptive flexible job-shop scheduling problem. Comput Oper Res 152:106156","journal-title":"Comput Oper Res"},{"key":"977_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108746","volume":"121","author":"P Karakostas","year":"2022","unstructured":"Karakostas P, Sifaleras A (2022) A double-adaptive general variable neighborhood search algorithm for the solution of the traveling salesman problem. Appl Soft Comput 121:108746","journal-title":"Appl Soft Comput"},{"key":"977_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.101887","volume":"94","author":"P Karakostas","year":"2025","unstructured":"Karakostas P, Sifaleras A (2025) Learning-assisted improvements in adaptive variable neighborhood search. Swarm Evol Comput 94:101887","journal-title":"Swarm Evol Comput"},{"issue":"7","key":"977_CR16","doi-asserted-by":"publisher","first-page":"2322","DOI":"10.1111\/poms.13977","volume":"32","author":"GA Kasapidis","year":"2023","unstructured":"Kasapidis GA, Dauz\u00e8re-P\u00e9r\u00e8s S, Paraskevopoulos DC et al (2023) On the multiresource flexible job-shop scheduling problem with arbitrary precedence graphs. Prod Oper Manag 32(7):2322\u20132330","journal-title":"Prod Oper Manag"},{"key":"977_CR17","doi-asserted-by":"publisher","first-page":"117796","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Zhao W et al (2022) A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Syst Appl 205:117796","journal-title":"Expert Syst Appl"},{"key":"977_CR18","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","journal-title":"Int J Prod Econ"},{"key":"977_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107302","volume":"106","author":"AD Li","year":"2021","unstructured":"Li AD, Xue B, Zhang M (2021) Improved binary particle swarm optimization for feature selection with new initialization and search space reduction strategies. Appl Soft Comput 106:107302","journal-title":"Appl Soft Comput"},{"issue":"15\u201316","key":"977_CR20","first-page":"4854","volume":"57","author":"Y Liu","year":"2018","unstructured":"Liu Y, Wang L, Wang XV et al (2018) Scheduling in cloud manufacturing: state-of-the-art and research challenges. Int J Prod Res 57(15\u201316):4854\u20134879","journal-title":"Int J Prod Res"},{"key":"977_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105020","volume":"123","author":"WT Lunardi","year":"2020","unstructured":"Lunardi WT, Birgin EG, Laborie P et al (2020) Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem. Comput Oper Res 123:105020","journal-title":"Comput Oper Res"},{"issue":"12","key":"977_CR22","doi-asserted-by":"publisher","first-page":"2375","DOI":"10.3390\/electronics14122375","volume":"14","author":"H Ma","year":"2025","unstructured":"Ma H, Yang T (2025) Improved adaptive large neighborhood search combined with simulated annealing (ialns-sa) algorithm for vehicle routing problem with simultaneous delivery and pickup and time windows. Electronics 14(12):2375","journal-title":"Electronics"},{"key":"977_CR23","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":"977_CR24","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.procs.2021.12.262","volume":"198","author":"L Nohair","year":"2022","unstructured":"Nohair L, Adraoui AE, Namir A (2022) Solving non-delay job-shop scheduling problems by a new matrix heuristic. Procedia Comput Sci 198:410\u2013416","journal-title":"Procedia Comput Sci"},{"issue":"14","key":"977_CR25","doi-asserted-by":"publisher","first-page":"6454","DOI":"10.3390\/app11146454","volume":"11","author":"JS Park","year":"2021","unstructured":"Park JS, Ng HY, Chua TJ et al (2021) Unified genetic algorithm approach for solving flexible job-shop scheduling problem. Appl Sci 11(14):6454","journal-title":"Appl Sci"},{"issue":"13","key":"977_CR26","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1016\/j.ifacol.2019.11.585","volume":"52","author":"D Rooyani","year":"2019","unstructured":"Rooyani D, Defersha FM (2019) An efficient two-stage genetic algorithm for flexible job-shop scheduling. IFAC-PapersOnLine 52(13):2519\u20132524","journal-title":"IFAC-PapersOnLine"},{"key":"977_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2025.109174","author":"ME Samouilidou","year":"2025","unstructured":"Samouilidou ME et al (2025) Enhancing industrial scheduling through machine learning: a synergistic approach with predictive modeling and clustering. Comput Chem Eng. https:\/\/doi.org\/10.1016\/j.compchemeng.2025.109174","journal-title":"Comput Chem Eng"},{"issue":"2","key":"977_CR28","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","volume":"19","author":"W Song","year":"2022","unstructured":"Song W, Chen X, Li Q et al (2022) Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Trans Industr Inf 19(2):1600\u20131610","journal-title":"IEEE Trans Industr Inf"},{"key":"977_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100632","volume":"53","author":"C Soto","year":"2020","unstructured":"Soto C, Dorronsoro B, Fraire H et al (2020) Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm. Swarm Evol Comput 53:100632","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"977_CR30","doi-asserted-by":"publisher","first-page":"3091","DOI":"10.1109\/TNNLS.2023.3306421","volume":"35","author":"R Wang","year":"2023","unstructured":"Wang R, Wang G, Sun J et al (2023) Flexible job shop scheduling via dual attention network-based reinforcement learning. IEEE Trans Neural Netw Learn Syst 35(3):3091\u20133120","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"6","key":"977_CR31","first-page":"156","volume":"27","author":"Z Wang","year":"2024","unstructured":"Wang Z, Deng C, Long J et al (2024) Assembly job-shop scheduling based on the multi-objective hybrid migrating birds optimization algorithm. Ind Eng J 27(6):156\u2013168","journal-title":"Ind Eng J"},{"key":"977_CR32","doi-asserted-by":"crossref","unstructured":"Wang P, De\u00a0Leone R, Sang H (2022) Improved migrating birds optimization algorithm to solve hybrid flowshop scheduling problem with lot-streaming of random breakdown. Machine Learning, Optimization, and Data Science 241\u2013245","DOI":"10.1007\/978-3-030-95470-3_18"},{"key":"977_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120268","volume":"227","author":"L Wei","year":"2023","unstructured":"Wei L, He J, Guo Z et al (2023) A multi-objective migrating birds optimization algorithm based on game theory for dynamic flexible job shop scheduling problem. Expert Syst Appl 227:120268","journal-title":"Expert Syst Appl"},{"issue":"3","key":"977_CR34","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","volume":"1","author":"J Xie","year":"2019","unstructured":"Xie J, Gao L, Peng K et al (2019) Review on flexible job shop scheduling. IET Collab Intell Manuf 1(3):67\u201377","journal-title":"IET Collab Intell Manuf"},{"key":"977_CR35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3535825","author":"S Yang","year":"2025","unstructured":"Yang S, Meng L, Ullah S et al (2025) Milp modeling and optimization of multi-objective three-stage flexible job shop scheduling problem with assembly and agv transportation. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2025.3535825","journal-title":"IEEE Access"},{"key":"977_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2019.102065","volume":"100","author":"M Zhang","year":"2020","unstructured":"Zhang M, Tan Y, Zhu J et al (2020) A competitive and cooperative migrating birds optimization algorithm for vary-sized batch splitting scheduling problem of flexible job-shop with setup time. Simul Model Pract Theory 100:102065","journal-title":"Simul Model Pract Theory"},{"issue":"1","key":"977_CR37","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.3934\/mbe.2024062","volume":"21","author":"C Zhao","year":"2024","unstructured":"Zhao C, Deng N (2024) An actor-critic framework based on deep reinforcement learning for addressing flexible job shop scheduling problems. Math Biosci Eng 21(1):1445\u20131471","journal-title":"Math Biosci Eng"},{"issue":"3","key":"977_CR38","doi-asserted-by":"publisher","first-page":"2912","DOI":"10.1109\/TASE.2023.3271666","volume":"21","author":"L Zhao","year":"2023","unstructured":"Zhao L, Fan J, Shen C et al (2023) A drl-based reactive scheduling policy for flexible job shops with random job arrivals. IEEE Trans Autom Sci Eng 21(3):2912\u20132923","journal-title":"IEEE Trans Autom Sci Eng"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00977-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-025-00977-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00977-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T08:50:06Z","timestamp":1763974206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-025-00977-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,24]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["977"],"URL":"https:\/\/doi.org\/10.1007\/s12351-025-00977-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,24]]},"assertion":[{"value":"12 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Since all data used in this study is derived from publicly available datasets and academic papers, ethical considerations and informed consent are not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}],"article-number":"99"}}