{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T19:56:56Z","timestamp":1782417416950,"version":"3.54.5"},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFB3307400"],"award-info":[{"award-number":["2023YFB3307400"]}],"id":[{"id":"10.13039\/501100012166","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,8]]},"DOI":"10.1016\/j.cor.2026.107500","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:51:47Z","timestamp":1775667107000},"page":"107500","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A deep Q-network enhanced variable neighborhood search algorithm based on NSGA-II for the multi-AGV flexible job shop scheduling problem with battery constraint"],"prefix":"10.1016","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7434-8290","authenticated-orcid":false,"given":"Tianen","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4574-071X","authenticated-orcid":false,"given":"Kai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojun","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shicheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaren","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2026.107500_b1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/EVCO_a_00009","article-title":"HypE: An algorithm for fast hypervolume-based many-objective optimization","volume":"19","author":"Bader","year":"2011","journal-title":"Evol. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107500_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."},{"key":"10.1016\/j.cor.2026.107500_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114567","article-title":"A Pareto based discrete Jaya algorithm for multi-objective flexible job shop scheduling problem","volume":"170","author":"Caldeira","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107500_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.112614","article-title":"A genetic programming based cooperative evolutionary algorithm for flexible job shop with crane transportation and setup times","volume":"169","author":"Chen","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107500_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101658","article-title":"A Q -Learning based NSGA-II for dynamic flexible job shop scheduling with limited transportation resources","volume":"90","author":"Chen","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107500_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107738","article-title":"An effective multi-population grey wolf optimizer based on reinforcement learning for flow shop scheduling problem with multi-machine collaboration","volume":"162","author":"Chen","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107500_b7","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":"11","key":"10.1016\/j.cor.2026.107500_b8","article-title":"An enhanced estimation of distribution algorithm for energy-efficient job-shop scheduling problems with transportation constraints","volume":"11","author":"Dai","year":"2019","journal-title":"Sustain."},{"key":"10.1016\/j.cor.2026.107500_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105517","article-title":"Scheduling heterogeneous multi-load AGVs with battery constraints","volume":"136","author":"Dang","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107500_b10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","article-title":"The flexible job shop scheduling problem: A review","volume":"314","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107500_b11","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.107500_b12","unstructured":"Deroussi, L., Norre, S., 2010. Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In: Proceedings of the International Conference on Metaheuristics and Nature Inspired Computing. Djerba Island, Tunisia, pp. 27\u201331."},{"issue":"4","key":"10.1016\/j.cor.2026.107500_b13","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/TETCI.2022.3145706","article-title":"Knowledge-based reinforcement learning and estimation of distribution algorithm for flexible job shop scheduling problem","volume":"7","author":"Du","year":"2023","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"10.1016\/j.cor.2026.107500_b14","series-title":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC\u201902 (Cat. No.02TH8600)","first-page":"723","article-title":"Diversity assessment of Pareto optimal solution sets: An entropy approach","volume":"vol. 1","author":"Farhang-Mehr","year":"2002"},{"issue":"2","key":"10.1016\/j.cor.2026.107500_b15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cor.2026.107500_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2023.101421","article-title":"Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility","volume":"84","author":"Gong","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107500_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101538","article-title":"A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV","volume":"86","author":"Han","year":"2024","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107500_b18","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1111\/itor.12878","article-title":"A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation","volume":"30","author":"Homayouni","year":"2023","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107500_b19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ifacol.2022.05.024","article-title":"An auto-MILP model for flexible job shop scheduling problem","volume":"55","author":"Huang","year":"2022","journal-title":"IFAC-PapersOnLine"},{"issue":"6","key":"10.1016\/j.cor.2026.107500_b20","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1109\/TEVC.2017.2776226","article-title":"Reference point specification in inverted generational distance for triangular linear Pareto front","volume":"22","author":"Ishibuchi","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"10","key":"10.1016\/j.cor.2026.107500_b21","doi-asserted-by":"crossref","first-page":"3127","DOI":"10.1007\/s12555-023-0578-1","article-title":"A review on intelligent scheduling and optimization for flexible job shop","volume":"21","author":"Jiang","year":"2023","journal-title":"Int. J. Control. Autom. Syst."},{"issue":"1","key":"10.1016\/j.cor.2026.107500_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. C"},{"key":"10.1016\/j.cor.2026.107500_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117796","article-title":"A multi-action deep reinforcement learning framework for flexible Job-shop scheduling problem","volume":"205","author":"Lei","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107500_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."},{"key":"10.1016\/j.cor.2026.107500_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117380","article-title":"A reinforcement learning based RMOEA\/D for bi-objective fuzzy flexible job shop scheduling","volume":"203","author":"Li","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"10.1016\/j.cor.2026.107500_b26","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TEVC.2022.3175832","article-title":"A learning-based memetic algorithm for energy-efficient flexible job-shop scheduling with type-2 fuzzy processing time","volume":"27","author":"Li","year":"2023","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107500_b27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TSMC.2023.3305541","article-title":"Co-evolution with deep reinforcement learning for energy-aware distributed heterogeneous flexible job shop scheduling","volume":"54","author":"Li","year":"2024","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"issue":"1","key":"10.1016\/j.cor.2026.107500_b28","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/s10033-022-00683-7","article-title":"Integrated production and transportation scheduling method in hybrid flow shop","volume":"35","author":"Li","year":"2022","journal-title":"Chin. J. Mech. Eng."},{"key":"10.1016\/j.cor.2026.107500_b29","article-title":"Optimizing flexible job shop scheduling with automated guided vehicles using a multi-strategy-driven genetic algorithm","volume":"25","author":"Li","year":"2024","journal-title":"Egypt. Inform. J."},{"key":"10.1016\/j.cor.2026.107500_b30","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.jmsy.2023.07.004","article-title":"An improved genetic algorithm with modified critical path-based searching for integrated process planning and scheduling problem considering automated guided vehicle transportation task","volume":"70","author":"Liu","year":"2023","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107500_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121149","article-title":"Knowledge-driven two-stage memetic algorithm for energy-efficient flexible job shop scheduling with machine breakdowns","volume":"235","author":"Luo","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"10.1016\/j.cor.2026.107500_b32","doi-asserted-by":"crossref","first-page":"3020","DOI":"10.1109\/TASE.2021.3104716","article-title":"Real-time scheduling for dynamic partial-no-wait multiobjective flexible job shop by deep reinforcement learning","volume":"19","author":"Luo","year":"2022","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"8","key":"10.1016\/j.cor.2026.107500_b33","doi-asserted-by":"crossref","first-page":"3815","DOI":"10.3390\/s23083815","article-title":"An improved genetic algorithm for solving the multi-AGV flexible job shop scheduling problem","volume":"23","author":"Meng","year":"2023","journal-title":"Sensors"},{"issue":"11","key":"10.1016\/j.cor.2026.107500_b34","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107500_b35","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.cie.2016.02.024","article-title":"Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model","volume":"102","author":"Nouri","year":"2016","journal-title":"Comput. Ind. Eng."},{"issue":"11","key":"10.1016\/j.cor.2026.107500_b36","doi-asserted-by":"crossref","first-page":"3360","DOI":"10.1080\/00207543.2020.1870013","article-title":"Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning","volume":"59","author":"Park","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107500_b37","article-title":"A single-individual based variable neighborhood search algorithm for the blocking hybrid flow shop group scheduling problem","volume":"27","author":"Peng","year":"2024","journal-title":"Egypt. Inform. J."},{"issue":"6","key":"10.1016\/j.cor.2026.107500_b38","doi-asserted-by":"crossref","first-page":"1572","DOI":"10.1007\/s12555-014-0553-y","article-title":"Positioning and obstacle avoidance of automatic guided vehicle in partially known environment","volume":"14","author":"Pratama","year":"2016","journal-title":"Int. J. Control. Autom. Syst."},{"issue":"6","key":"10.1016\/j.cor.2026.107500_b39","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: A multiobjective evolutionary algorithm based on decomposition","volume":"11","author":"Qingfu Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107500_b40","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.eij.2015.06.001","article-title":"Multiobjective variable neighborhood search algorithm for scheduling independent jobs on computational grid","volume":"16","author":"Selvi","year":"2015","journal-title":"Egypt. Inform. J."},{"issue":"1","key":"10.1016\/j.cor.2026.107500_b41","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ijpe.2004.05.005","article-title":"The common cycle economic lot scheduling in flexible job shops: The finite horizon case","volume":"97","author":"Torabi","year":"2005","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"10.1016\/j.cor.2026.107500_b42","doi-asserted-by":"crossref","DOI":"10.1198\/004017002320256440","article-title":"Design of experiments using the Taguchi approach: 16 steps to product and process improvement","volume":"44","author":"Van Nostrand","year":"2002","journal-title":"Technometrics"},{"key":"10.1016\/j.cor.2026.107500_b43","article-title":"A hybrid algorithm considering continuous transportation for flexible job shop scheduling problem with finite transportation resources","author":"Wang","year":"2024","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.cor.2026.107500_b44","article-title":"A diversity-enhanced tri-stage framework for constrained multi-objective optimization","author":"Wang","year":"2024","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107500_b45","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s00500-008-0394-9","article-title":"Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure","volume":"14","author":"Wang","year":"2010","journal-title":"Soft Comput."},{"key":"10.1016\/j.cor.2026.107500_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2021.102198","article-title":"Research on flexible job shop scheduling under finite transportation conditions for digital twin workshop","volume":"72","author":"Yan","year":"2021","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107500_b47","doi-asserted-by":"crossref","first-page":"25369","DOI":"10.1109\/ACCESS.2025.3535825","article-title":"MILP modeling and optimization of multi-objective three-stage flexible job shop scheduling problem with assembly and AGV transportation","volume":"13","author":"Yang","year":"2025","journal-title":"IEEE Access"},{"key":"10.1016\/j.cor.2026.107500_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101544","article-title":"A DQN-based memetic algorithm for energy-efficient job shop scheduling problem with integrated limited AGVs","volume":"87","author":"Yao","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107500_b49","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2022.102506","article-title":"A novel MILP model for job shop scheduling problem with mobile robots","volume":"81","author":"Yao","year":"2023","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107500_b50","article-title":"Research on flexible job shop scheduling problem with AGV using double DQN","author":"Yuan","year":"2023","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107500_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.109917","article-title":"Deep reinforcement learning-based memetic algorithm for energy-aware flexible job shop scheduling with multi-AGV","volume":"189","author":"Zhang","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107500_b52","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.109917","article-title":"Deep reinforcement learning-based memetic algorithm for energy-aware flexible job shop scheduling with multi-AGV","volume":"189","author":"Zhang","year":"2024","journal-title":"Comput. Ind. Eng."},{"issue":"23","key":"10.1016\/j.cor.2026.107500_b53","doi-asserted-by":"crossref","first-page":"83","DOI":"10.3901\/JME.2004.02.083","article-title":"An improved genetic algorithm for the job shop scheduling problem","volume":"15","author":"Zhang","year":"2004","journal-title":"China Mech. Eng."},{"key":"10.1016\/j.cor.2026.107500_b54","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109718","article-title":"Dynamic scheduling for flexible job shop with insufficient transportation resources via graph neural network and deep reinforcement learning","volume":"186","author":"Zhang","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107500_b55","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.101945","article-title":"Learning-driven memetic algorithm for solving integrated distributed production and transportation scheduling problem","volume":"96","author":"Zhao","year":"2025","journal-title":"Swarm Evol. Comput."},{"issue":"19","key":"10.1016\/j.cor.2026.107500_b56","doi-asserted-by":"crossref","first-page":"5748","DOI":"10.1080\/00207543.2014.910628","article-title":"A tabu search algorithm for simultaneous machine\/AGV scheduling problem","volume":"52","author":"Zheng","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107500_b57","series-title":"SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization","article-title":"SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization","volume":"vol. 3242","author":"Zitzler","year":"2001"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001188?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:21:33Z","timestamp":1776684093000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":57,"alternative-id":["S0305054826001188"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107500","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A deep Q-network enhanced variable neighborhood search algorithm based on NSGA-II for the multi-AGV flexible job shop scheduling problem with battery constraint","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107500","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":"107500"}}