{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T15:04:10Z","timestamp":1774883050649,"version":"3.50.1"},"reference-count":54,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100008095","name":"YSU","doi-asserted-by":"publisher","award":["22567612H"],"award-info":[{"award-number":["22567612H"]}],"id":[{"id":"10.13039\/501100008095","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.cor.2026.107457","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:48:00Z","timestamp":1772819280000},"page":"107457","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An improved genetic algorithm based on game theory for multi-objective flexible job shop scheduling problem with batch processing machines"],"prefix":"10.1016","volume":"191","author":[{"given":"Lixin","family":"Wei","sequence":"first","affiliation":[]},{"given":"Qian","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zeyin","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Jinxian","family":"He","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107457_b1","first-page":"149","article-title":"A green model for identical parallel machines scheduling problem considering tardy jobs and job splitting property","volume":"3","author":"Asadpour","year":"2022","journal-title":"Sustain. Oper. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107457_b2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Ann. Oper. Res."},{"issue":"8","key":"10.1016\/j.cor.2026.107457_b3","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1007\/s10845-015-1084-y","article-title":"Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms","volume":"28","author":"Chang","year":"2017","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107457_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120891","article-title":"A hybrid evolutionary immune algorithm for fuzzy flexible job shop scheduling problem with variable processing speeds","volume":"233","author":"Chen","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107457_b5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","article-title":"Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints","volume":"59","author":"Dai","year":"2019","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"2","key":"10.1016\/j.cor.2026.107457_b6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107457_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101550","article-title":"Multi-policy deep reinforcement learning for multi-objective multiplicity flexible job shop scheduling","volume":"87","author":"Ding","year":"2024","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107457_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","article-title":"A survey of scheduling with parallel batch (p-batch) processing","volume":"298","author":"Fowler","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107457_b9","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","article-title":"A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems","volume":"6","author":"Gao","year":"2019","journal-title":"IEEE\/CAA J. Autom. Sin."},{"issue":"21","key":"10.1016\/j.cor.2026.107457_b10","doi-asserted-by":"crossref","first-page":"7652","DOI":"10.1016\/j.eswa.2015.06.004","article-title":"A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion","volume":"42","author":"Gao","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107457_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106508","article-title":"A simulation optimization framework to solve stochastic flexible job-shop scheduling problems\u2014Case: Semiconductor manufacturing","volume":"163","author":"Ghaedy-Heidary","year":"2024","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"10.1016\/j.cor.2026.107457_b12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.3390\/a12110243","article-title":"An improved genetic algorithm with adaptive variable neighborhood search for FJSP","volume":"12","author":"Gu","year":"2019","journal-title":"Algorithms"},{"key":"10.1016\/j.cor.2026.107457_b13","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.jmsy.2024.03.009","article-title":"An improved genetic programming hyper-heuristic for the dynamic flexible job shop scheduling problem with reconfigurable manufacturing cells","volume":"74","author":"Guo","year":"2024","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107457_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102114","article-title":"Dynamic flexible job shop scheduling algorithm for multi-task collaborative optimization","volume":"98","author":"Guo","year":"2025","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107457_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.113157","article-title":"A variable window multi-interval rescheduling optimization algorithm for dynamic flexible job shop problem","volume":"176","author":"Guo","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107457_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107027","article-title":"Multi-objective flexible job shop scheduling based on feature information optimization algorithm","volume":"179","author":"Guo","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107457_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108745","article-title":"Lot streaming in hybrid flowshop scheduling problem by considering equal and consistent sublots under machine capability and limited waiting time constraint","volume":"173","author":"G\u00fcrsoy Y\u0131lmaz","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107457_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106967","article-title":"Seru scheduling problem with lot streaming and worker transfers: A multi-objective approach","volume":"177","author":"G\u00fcrsoy Y\u0131lmaz","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107457_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109680","article-title":"Lot streaming in workforce scheduling problem for seru production system under Shojinka philosophy","volume":"185","author":"G\u00fcrsoy Y\u0131lmaz","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107457_b20","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.apm.2016.12.034","article-title":"Flexible job shop scheduling problem for parallel batch processing machine with compatible job families","volume":"45","author":"Ham","year":"2017","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.cor.2026.107457_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106442","article-title":"Novel model and solution method for flexible job shop scheduling problem with batch processing machines","volume":"161","author":"Ji","year":"2024","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107457_b22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","article-title":"Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems","volume":"32","author":"Kacem","year":"2002","journal-title":"IEEE Trans. Syst. Man Cybern. Part C (Applications Reviews)"},{"key":"10.1016\/j.cor.2026.107457_b23","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.cie.2018.09.016","article-title":"An improved cuckoo search algorithm for scheduling jobs on identical parallel machines","volume":"126","author":"Laha","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107457_b24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","author":"Li","year":"2016","journal-title":"Int. J. Prod. Econ."},{"issue":"11","key":"10.1016\/j.cor.2026.107457_b25","doi-asserted-by":"crossref","first-page":"3234","DOI":"10.1109\/TFUZZ.2020.3016225","article-title":"Improved artificial immune system algorithm for type-2 fuzzy flexible job shop scheduling problem","volume":"29","author":"Li","year":"2021","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"10.1016\/j.cor.2026.107457_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.107321","article-title":"An improved genetic algorithm with an overlapping strategy for solving a combination of order batching and flexible job shop scheduling problem","volume":"127","author":"Liu","year":"2024","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cor.2026.107457_b27","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.procs.2020.02.061","article-title":"Improved genetic algorithm for solving flexible job shop scheduling problem","volume":"166","author":"Luo","year":"2020","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.cor.2026.107457_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115066","article-title":"Product processing prioritization in hybrid flow shop systems supported on Nash bargaining model and simulation-optimization","volume":"180","author":"Malekpour","year":"2021","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.cor.2026.107457_b29","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.ejor.2020.01.065","article-title":"Exact algorithms to minimize makespan on single and parallel batch processing machines","volume":"285","author":"Muter","year":"2020","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107457_b30","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.cie.2019.07.011","article-title":"Production scheduling and lot streaming at flexible job-shops environments using constraint programming","volume":"136","author":"Novas","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107457_b31","article-title":"A non-cooperative game approach on isolated water-energy microgrids","volume":"38","author":"P\u00e1rraga","year":"2024","journal-title":"Sustain. Energy Grids Netw."},{"key":"10.1016\/j.cor.2026.107457_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2022.101623","article-title":"Exact and metaheuristic algorithms for the vehicle routing problem with a factory-in-a-box in multi-objective settings","volume":"52","author":"Pasha","year":"2022","journal-title":"Adv. Eng. Inform."},{"issue":"2","key":"10.1016\/j.cor.2026.107457_b33","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","article-title":"Scheduling with batching: A review","volume":"120","author":"Potts","year":"2000","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107457_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116584","article-title":"Competitive scheduling in a hybrid flow shop problem using multi-leader\u2013multi-follower game - a case study from Iran","volume":"195","author":"Safari","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"8","key":"10.1016\/j.cor.2026.107457_b35","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1080\/0305215X.2016.1256394","article-title":"Increasing production rate in U-type assembly lines with sequence-dependent set-up times","volume":"49","author":"\u015eahin","year":"2017","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cor.2026.107457_b36","doi-asserted-by":"crossref","DOI":"10.18517\/ijaseit.8.4-2.6808","article-title":"Population initialisation methods for fuzzy job-shop scheduling problems: Issues and future trends","author":"Shaheed","year":"2018","journal-title":"Int. J. Adv. Sci. Eng. Inf. Technol."},{"issue":"13","key":"10.1016\/j.cor.2026.107457_b37","doi-asserted-by":"crossref","first-page":"3858","DOI":"10.1080\/00207543.2013.784408","article-title":"Scheduling flexible job shop problem subject to machine breakdown with game theory","volume":"52","author":"Sun","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107457_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119359","article-title":"Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system","volume":"215","author":"Sun","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107457_b39","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10951-017-0530-4","article-title":"A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines","volume":"21","author":"Tan","year":"2018","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2026.107457_b40","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.asoc.2019.02.011","article-title":"Flexible job-shop scheduling with tolerated time interval and limited starting time interval based on hybrid discrete PSO-SA: An application from a casting workshop","volume":"78","author":"Tang","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107457_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121723","article-title":"A DQL-NSGA-III algorithm for solving the flexible job shop dynamic scheduling problem","volume":"237","author":"Tang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107457_b42","doi-asserted-by":"crossref","first-page":"3678","DOI":"10.1016\/j.proeng.2011.08.689","article-title":"A hybrid algorithm for flexible job-shop scheduling problem","volume":"15","author":"Tang","year":"2011","journal-title":"Procedia Eng."},{"key":"10.1016\/j.cor.2026.107457_b43","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109111","article-title":"Dynamic energy-efficient scheduling of multi-variety and small batch flexible job-shop: A case study for the aerospace industry","volume":"178","author":"Tian","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107457_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106222","article-title":"A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting","volume":"155","author":"Tutumlu","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107457_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2021.126093","article-title":"Evolutionary game based real-time scheduling for energy-efficient distributed and flexible job shop","volume":"293","author":"Wang","year":"2021","journal-title":"J. Clean. Prod."},{"issue":"2","key":"10.1016\/j.cor.2026.107457_b46","doi-asserted-by":"crossref","first-page":"2518","DOI":"10.1109\/JIOT.2018.2871346","article-title":"Multiagent and bargaining-game-based real-time scheduling for internet of things-enabled flexible job shop","volume":"6","author":"Wang","year":"2019","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.cor.2026.107457_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120268","article-title":"A multi-objective migrating birds optimization algorithm based on game theory for dynamic flexible job shop scheduling problem","volume":"227","author":"Wei","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107457_b48","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.jmsy.2024.03.005","article-title":"An improved memetic algorithm for multi-objective resource-constrained flexible job shop inverse scheduling problem: An application for machining workshop","volume":"74","author":"Wei","year":"2024","journal-title":"J. Manuf. Syst."},{"issue":"1","key":"10.1016\/j.cor.2026.107457_b49","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.ejor.2021.09.044","article-title":"Job scheduling of diffusion furnaces in semiconductor fabrication facilities","volume":"301","author":"Wu","year":"2022","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107457_b50","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.jmsy.2023.09.002","article-title":"A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems","volume":"71","author":"Xie","year":"2023","journal-title":"J. Manuf. Syst."},{"issue":"11","key":"10.1016\/j.cor.2026.107457_b51","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.3934\/jimo.2024058","article-title":"Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time","volume":"20","author":"Y\u0131lmaz","year":"2024","journal-title":"J. Ind. Manag. Optim."},{"key":"10.1016\/j.cor.2026.107457_b52","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117460","article-title":"An effective two-stage algorithm based on convolutional neural network for the bi-objective flexible job shop scheduling problem with machine breakdown","volume":"203","author":"Zhang","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107457_b53","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121205","article-title":"An effective reformative memetic algorithm for distributed flexible job-shop scheduling problem with order cancellation","volume":"237","author":"Zhu","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107457_b54","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/j.cie.2019.03.022","article-title":"A novel approach based on neo4j for multi-constrained flexible job shop scheduling problem","volume":"130","author":"Zhu","year":"2019","journal-title":"Comput. Ind. Eng."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000754?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000754?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T14:30:13Z","timestamp":1774881013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":54,"alternative-id":["S0305054826000754"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107457","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An improved genetic algorithm based on game theory for multi-objective flexible job shop scheduling problem with batch processing machines","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107457","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107457"}}