{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T14:59:01Z","timestamp":1783004341785,"version":"3.54.5"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202434"],"award-info":[{"award-number":["62202434"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62403367"],"award-info":[{"award-number":["62403367"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Youth Backbone Teachers of Undergraduate Universities in Henan Province, China","award":["2023GGJS111"],"award-info":[{"award-number":["2023GGJS111"]}]},{"name":"Graduate Education Innovation Program Fund of Zhengzhou University of Aeronautics","award":["2025CX119"],"award-info":[{"award-number":["2025CX119"]}]},{"name":"Open Found of the Engineering Research Center of Intelligent Swarm Systems, Ministry of Education, China","award":["ZZU-CIS3-2024005"],"award-info":[{"award-number":["ZZU-CIS3-2024005"]}]},{"name":"Henan Province key research and development project, China","award":["231111212000"],"award-info":[{"award-number":["231111212000"]}]},{"name":"Science and Technology Innovation Leading Talent Support Program of Henan Province, China","award":["254000510017"],"award-info":[{"award-number":["254000510017"]}]},{"name":"Henan Province Higher Education Key Research Project","award":["25CY039"],"award-info":[{"award-number":["25CY039"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>With the growing emphasis on intelligent and sustainable manufacturing, the flexible job shop scheduling problem (FJSP) has emerged as a critical optimization challenge due to its capability to model complex and dynamic production environments. As an NP-hard problem, FJSP poses significantly greater complexity than the classical job shop scheduling problem, particularly in high-precision domains such as aerospace manufacturing, where traditional optimization methods often fall short. To overcome the limitations of the standard Whale Optimization Algorithm (WOA)\u2013namely its continuous search paradigm and inadequate local search mechanisms\u2013this paper proposes a genetic-operator-integrated whale optimization algorithm (GOI-WOA) tailored for discrete scheduling tasks. The GOI-WOA employs a two-layer discrete encoding strategy to represent operations and machine assignments, and introduces genetic operators, a critical-path-based neighborhood search, and a temporal-entropy-based local search to enhance solution diversity and local exploitation. Furthermore, an elite information-sharing mechanism is incorporated to facilitate the diffusion of high-quality solutions within the population. Comprehensive experiments conducted on standard benchmark instances demonstrate that GOI-WOA consistently outperforms baseline WOA and other state-of-the-art methods in terms of makespan minimization, convergence stability, and computational efficiency. These results validate the effectiveness and robustness of GOI-WOA as a competitive solution framework for complex manufacturing scheduling problems.<\/jats:p>","DOI":"10.1007\/s44443-025-00283-0","type":"journal-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T14:19:35Z","timestamp":1760624375000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A genetic-operator-integrated whale optimization algorithm for solving the flexible job shop scheduling problem"],"prefix":"10.1007","volume":"37","author":[{"given":"Ying","family":"Duan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luyi","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lingling","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuezhuan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3428-9493","authenticated-orcid":false,"given":"Lijun","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,16]]},"reference":[{"key":"283_CR1","doi-asserted-by":"publisher","unstructured":"Amjad MK, Butt SI, Anjum N (2021) Improved Genetic Algorithm Integrated with Scheduling Rules for Flexible Job Shop Scheduling Problems. In: E3S web of conferences, vol 243, p 02010. EDP Sciences, Shanghai, China. https:\/\/doi.org\/10.1051\/e3sconf\/202124302010","DOI":"10.1051\/e3sconf\/202124302010"},{"key":"283_CR2","doi-asserted-by":"publisher","unstructured":"Afolabi AE, Popoola API, Popoola OM (2021) High Entropy Alloys: Advance Material for Landing Gear Aerospace Applications. In: Kharissova OV, Kharisov BI, Vald\u00e9s JR (eds) Handbook of nanomaterials and nanocomposites for energy and environmental applications, pp 2359\u20132385. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-36268-3_179","DOI":"10.1007\/978-3-030-36268-3_179"},{"issue":"3","key":"283_CR3","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":"283_CR4","doi-asserted-by":"publisher","unstructured":"Berrada M, Stecke KE (1986) A branch and bound approach for machine load balancing in flexible manufacturing systems. Manage Sci 32(10):1316\u20131335. https:\/\/doi.org\/10.1287\/mnsc.32.10.1316","DOI":"10.1287\/mnsc.32.10.1316"},{"issue":"4","key":"283_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/bf02238804","volume":"45","author":"P Brucker","year":"1991","unstructured":"Brucker P, Schlie R (1991) Job-shop scheduling with multi-purpose machines. Computing 45(4):369\u2013375. https:\/\/doi.org\/10.1007\/bf02238804","journal-title":"Computing"},{"issue":"4","key":"283_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Futur Gener Comput Syst 26(4):533\u2013541. https:\/\/doi.org\/10.1016\/j.future.2009.10.004","journal-title":"Futur Gener Comput Syst"},{"issue":"3","key":"283_CR7","doi-asserted-by":"publisher","first-page":"3117","DOI":"10.1109\/JSYST.2019.2960088","volume":"14","author":"X Chen","year":"2020","unstructured":"Chen X, Cheng L, Liu C, Liu Q, Liu J, Mao Y, Murphy J (2020) A woa-based optimization approach for task scheduling in cloud computing systems. IEEE Syst J 14(3):3117\u20133128. https:\/\/doi.org\/10.1109\/JSYST.2019.2960088","journal-title":"IEEE Syst J"},{"key":"283_CR8","doi-asserted-by":"publisher","unstructured":"Coca G, Castrill\u00f3n OD, Ruiz S, Mateo-Sanz JM, Jim\u00e9nez L (2019) Sustainable Evaluation of Environmental and Occupational Risks Scheduling Flexible Job Shop Manufacturing Systems. J Cleaner Prod 209:146\u2013168. https:\/\/doi.org\/10.1016\/j.jclepro.2018.10.193","DOI":"10.1016\/j.jclepro.2018.10.193"},{"key":"283_CR9","doi-asserted-by":"publisher","unstructured":"Cohen J (1988) Statistical Power Analysis for the Behavioral Sciences, 2nd edn., p 567. Lawrence Erlbaum Associates, Hillsdale, NJ. https:\/\/doi.org\/10.1016\/0198-9715(90)90050-4","DOI":"10.1016\/0198-9715(90)90050-4"},{"key":"283_CR10","doi-asserted-by":"publisher","unstructured":"Chakraborty S, Sharma S, Saha AK, Saha A (2022) A novel improved whale optimization algorithm to solve numerical optimization and real-world applications. Artif Intell Rev 1\u2013112. https:\/\/doi.org\/10.1007\/s10462-021-10114-z","DOI":"10.1007\/s10462-021-10114-z"},{"key":"283_CR11","doi-asserted-by":"publisher","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","DOI":"10.1016\/j.cie.2020.106778"},{"key":"283_CR12","doi-asserted-by":"publisher","unstructured":"Cui X, Zhu J, Jia L, Wang J, Wu Y (2024) A novel heat load prediction model of district heating system based on hybrid whale optimization algorithm (WOA) and CNN-LSTM with attention mechanism. Energy 312:133536. https:\/\/doi.org\/10.1016\/j.energy.2024.133536","DOI":"10.1016\/j.energy.2024.133536"},{"key":"283_CR13","doi-asserted-by":"publisher","unstructured":"Ding H, Gu X (2020) Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput Oper Res 121:104951. https:\/\/doi.org\/10.1016\/j.cor.2020.104951","DOI":"10.1016\/j.cor.2020.104951"},{"issue":"1","key":"283_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evol Comput"},{"key":"283_CR15","doi-asserted-by":"publisher","unstructured":"Du P, Ye Y, Wu H, Wang J (2025) Study on deterministic and interval forecasting of electricity load based on multi-objective whale optimization algorithm and transformer model. Expert Syst Appl 268:126361. https:\/\/doi.org\/10.1016\/j.eswa.2024.126361","DOI":"10.1016\/j.eswa.2024.126361"},{"key":"283_CR16","doi-asserted-by":"publisher","unstructured":"Fattahi P, Saidi\u00a0Mehrabad M, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18:331\u2013342. https:\/\/doi.org\/10.1007\/s10845-007-0026-8","DOI":"10.1007\/s10845-007-0026-8"},{"issue":"2","key":"283_CR17","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS (1976) Sethi r: the complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129. https:\/\/doi.org\/10.1287\/moor.1.2.117","journal-title":"Math Oper Res"},{"issue":"9","key":"283_CR18","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9):2892\u20132907. https:\/\/doi.org\/10.1016\/j.cor.2007.01.001","journal-title":"Comput Oper Res"},{"key":"283_CR19","doi-asserted-by":"publisher","unstructured":"Hao X, Li Y, Wang K, Sun Q, Wu H (2025) Eco-intelligent Production: Intelligent Manufacturing and Industrial Green Transition. Environ Dev Sustain 1\u201331. https:\/\/doi.org\/10.1007\/s10668-024-05935-1","DOI":"10.1007\/s10668-024-05935-1"},{"key":"283_CR20","doi-asserted-by":"publisher","unstructured":"Jiang Z, Yuan S, Ma J, Wang Q (2022) The Evolution of Production Scheduling from Industry 3.0 through Industry 4.0. Int J Prod Res 60(11):3534\u20133554. https:\/\/doi.org\/10.1080\/00207543.2021.1925772","DOI":"10.1080\/00207543.2021.1925772"},{"key":"283_CR21","doi-asserted-by":"publisher","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:26231\u201326240. https:\/\/doi.org\/10.1109\/ACCESS.2018.2833552","DOI":"10.1109\/ACCESS.2018.2833552"},{"key":"283_CR22","doi-asserted-by":"publisher","unstructured":"Jiang T, Zhang C, Sun Q-M (2019) Green job shop scheduling problem with discrete whale optimization algorithm. IEEE Access 7:43153\u201343166. https:\/\/doi.org\/10.1109\/ACCESS.2019.2908200","DOI":"10.1109\/ACCESS.2019.2908200"},{"key":"283_CR23","doi-asserted-by":"publisher","unstructured":"K\u00fclahl\u0131 S, Engin O, Ko\u00e7 \u0130 (2021) A new hybrid scatter search algorithm for solving the flexible job shop scheduling problems. Celal Bayar Univ J Sci 17(4):347\u2013359. https:\/\/doi.org\/10.18466\/cbayarfbe.926756","DOI":"10.18466\/cbayarfbe.926756"},{"key":"283_CR24","doi-asserted-by":"publisher","unstructured":"Kacem I, Hammadi S, Borne P (2002) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern C (Applications and Reviews) 32(1):1\u201313. https:\/\/doi.org\/10.1109\/tsmcc.2002.1009117","DOI":"10.1109\/tsmcc.2002.1009117"},{"issue":"9","key":"283_CR25","doi-asserted-by":"publisher","first-page":"6007","DOI":"10.1007\/s00500-023-08074-3","volume":"27","author":"X Lan","year":"2023","unstructured":"Lan X, Chen H (2023) Simulation analysis of production scheduling algorithm for intelligent manufacturing cell based on artificial intelligence technology. Soft Comput 27(9):6007\u20136017. https:\/\/doi.org\/10.1007\/s00500-023-08074-3","journal-title":"Soft Comput"},{"key":"283_CR26","doi-asserted-by":"publisher","unstructured":"Li W, Yan X, Huang Y (2024) Cooperative-guided ant colony optimization with knowledge learning for job shop scheduling problem. Tsinghua Sci Technol 29(5):1283\u20131299. https:\/\/doi.org\/10.26599\/TST.2023.9010098","DOI":"10.26599\/TST.2023.9010098"},{"key":"283_CR27","doi-asserted-by":"publisher","unstructured":"Ma J, Gao W, Tong W (2025) A deep reinforcement learning assisted adaptive genetic algorithm for flexible job shop scheduling. Eng Appl Artif Intell 149:110447. https:\/\/doi.org\/10.1016\/j.engappai.2025.110447","DOI":"10.1016\/j.engappai.2025.110447"},{"key":"283_CR28","doi-asserted-by":"publisher","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"issue":"3","key":"283_CR29","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1016\/j.ejor.2022.01.034","volume":"302","author":"D M\u00fcller","year":"2022","unstructured":"M\u00fcller D, M\u00fcller MG, Kress D, Pesch E (2022) An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning. Eur J Oper Res 302(3):874\u2013891. https:\/\/doi.org\/10.1016\/j.ejor.2022.01.034","journal-title":"Eur J Oper Res"},{"key":"283_CR30","doi-asserted-by":"publisher","unstructured":"Nadimi-Shahraki MH, Zamani H, Mirjalili S (2022) Enhanced whale optimization algorithm for medical feature selection: A COVID-19 case study. Comput Biol Med 148:105858. https:\/\/doi.org\/10.1016\/j.compbiomed.2022.105858","DOI":"10.1016\/j.compbiomed.2022.105858"},{"issue":"6","key":"283_CR31","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","volume":"34","author":"C \u00d6zg\u00fcven","year":"2010","unstructured":"\u00d6zg\u00fcven C, \u00d6zbak\u0131r L, Yavuz Y (2010) Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl Math Model 34(6):1539\u20131548. https:\/\/doi.org\/10.1016\/j.apm.2009.09.002","journal-title":"Appl Math Model"},{"key":"283_CR32","doi-asserted-by":"publisher","unstructured":"Phuang A (2017) The Flower Pollination Algorithm with Disparity Count Process for Scheduling Problem. In: Proceedings of the 2017 9th international conference on information technology\u00a0and electrical engineering (ICITEE 2017), pp 1\u20135. IEEE, Phuket, Thailand. https:\/\/doi.org\/10.1109\/ICITEED.2017.8250497","DOI":"10.1109\/ICITEED.2017.8250497"},{"issue":"10","key":"283_CR33","doi-asserted-by":"publisher","first-page":"5648","DOI":"10.3390\/app15105648","volume":"15","author":"Y Peng","year":"2025","unstructured":"Peng Y, Lyu Y, Zhang J, Chu Y (2025) Heterogeneous graph neural-network-based scheduling optimization for multi-product and variable-batch production in flexible job shops. Appl Sci 15(10):5648. https:\/\/doi.org\/10.3390\/app15105648","journal-title":"Appl Sci"},{"key":"283_CR34","doi-asserted-by":"publisher","unstructured":"Park J-S, Ng H-Y, Chua T-J, Ng Y-T, Kim J-W (2021) Unified genetic algorithm approach for solving flexible job-shop scheduling problem. Appl Sci 11(14):6454 https:\/\/doi.org\/10.3390\/app11146454","DOI":"10.3390\/app11146454"},{"key":"283_CR35","doi-asserted-by":"publisher","unstructured":"Quinton F, Hamaz I, Houssin L (2020) A mixed integer linear programming modelling for the flexible cyclic jobshop problem. Annals Oper Res 285:335\u2013352. https:\/\/doi.org\/10.1007\/s10479-019-03387-9","DOI":"10.1007\/s10479-019-03387-9"},{"key":"283_CR36","doi-asserted-by":"publisher","unstructured":"Shi J, Chen M, Ma Y, Qiao F (2023) A new boredom-aware dual-resource constrained flexible job shop scheduling problem using a two-stage multi-objective particle swarm optimization algorithm. Inf Sci 643:119141. https:\/\/doi.org\/10.1016\/j.ins.2023.119141","DOI":"10.1016\/j.ins.2023.119141"},{"key":"283_CR37","doi-asserted-by":"publisher","unstructured":"Shu T, Pan Z, Ding Z, Zu Z (2024) Resource scheduling optimization for industrial operating system using deep reinforcement learning and WOA algorithm. Expert Syst Appl 255:124765. https:\/\/doi.org\/10.1016\/j.eswa.2024.124765","DOI":"10.1016\/j.eswa.2024.124765"},{"key":"283_CR38","doi-asserted-by":"publisher","unstructured":"Sun K, Zheng D, Song H, Cheng Z, Lang X, Yuan W, Wang J (2023) Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system. Expert Syst Appl 215:119359. https:\/\/doi.org\/10.1016\/j.eswa.2022.119359","DOI":"10.1016\/j.eswa.2022.119359"},{"key":"283_CR39","doi-asserted-by":"publisher","unstructured":"Watanabe M, Ida K, Gen M (2005) A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Comput Ind Eng 48(4):743\u2013752. https:\/\/doi.org\/10.1016\/j.cie.2004.12.008","DOI":"10.1016\/j.cie.2004.12.008"},{"issue":"3","key":"283_CR40","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"},{"key":"283_CR41","doi-asserted-by":"publisher","unstructured":"Yuraszeck F, Montero E, Canut-De-Bon D, Cuneo N, Rojel M (2023) A constraint programming formulation of the multi-mode resource-constrained project scheduling problem for the flexible job shop scheduling problem. IEEE Access 11:144928\u2013144938. https:\/\/doi.org\/10.1109\/ACCESS.2023.3345793","DOI":"10.1109\/ACCESS.2023.3345793"},{"key":"283_CR42","doi-asserted-by":"publisher","unstructured":"Yankai W, Shilong W, Dong L, Chunfeng S, Bo Y (2021) An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic reconfiguration processes. Expert Syst Appl 174:114793. https:\/\/doi.org\/10.1016\/j.eswa.2021.114793","DOI":"10.1016\/j.eswa.2021.114793"},{"key":"283_CR43","doi-asserted-by":"publisher","unstructured":"Yang W, Su J, Yao Y, Yang Z, Yuan Y (2022) A novel hybrid whale optimization algorithm for flexible job-shop scheduling problem. Machines 10(8):618. https:\/\/doi.org\/10.3390\/machines10080618","DOI":"10.3390\/machines10080618"},{"key":"283_CR44","doi-asserted-by":"publisher","unstructured":"Yuan E, Wang L, Cheng S, Song S, Fan W, Li Y (2024) Solving flexible job shop scheduling problems via deep reinforcement learning. Expert Syst Appl 245:123019. https:\/\/doi.org\/10.1016\/j.eswa.2023.123019","DOI":"10.1016\/j.eswa.2023.123019"},{"issue":"24","key":"283_CR45","doi-asserted-by":"publisher","first-page":"4650","DOI":"10.3923\/jas.2008.4650.4655","volume":"8","author":"M Zandieh","year":"2008","unstructured":"Zandieh M, Mahdavi I, Bagheri A (2008) Solving the flexible job-shop scheduling problem by a genetic algorithm. J Appl Sci 8(24):4650\u20134655. https:\/\/doi.org\/10.3923\/jas.2008.4650.4655","journal-title":"J Appl Sci"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00283-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00283-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00283-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T15:45:36Z","timestamp":1763567136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00283-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,16]]},"references-count":45,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00283-0","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,16]]},"assertion":[{"value":"4 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"259"}}