{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:03:00Z","timestamp":1784894580616,"version":"3.55.0"},"reference-count":52,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72071056"],"award-info":[{"award-number":["72071056"]}],"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":["72371095"],"award-info":[{"award-number":["72371095"]}],"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":["72501092"],"award-info":[{"award-number":["72501092"]}],"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":["72101077"],"award-info":[{"award-number":["72101077"]}],"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":["71922009"],"award-info":[{"award-number":["71922009"]}],"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":["JZ2024HGQB0089"],"award-info":[{"award-number":["JZ2024HGQB0089"]}],"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":["W2411063"],"award-info":[{"award-number":["W2411063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013314","name":"Higher Education Discipline Innovation Project","doi-asserted-by":"publisher","award":["B17014"],"award-info":[{"award-number":["B17014"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107576","type":"journal-article","created":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T23:58:30Z","timestamp":1780531110000},"page":"107576","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Deep reinforcement learning for workpieces heat treatment batch scheduling considering compatibility-dependent setup times"],"prefix":"10.1016","volume":"194","author":[{"given":"Chaoming","family":"Hu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yonghuang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaojun","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"21","key":"10.1016\/j.cor.2026.107576_b1","doi-asserted-by":"crossref","first-page":"6453","DOI":"10.1080\/00207543.2019.1680900","article-title":"Optimal job scheduling and inspection of a machine with delayed failure","volume":"58","author":"Azimpoor","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107576_b2","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.jmsy.2017.12.005","article-title":"Dynamic scheduling of parallel heat treatment furnaces: A case study at a manufacturing system","volume":"46","author":"Baykaso\u011flu","year":"2018","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107576_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2023.102628","article-title":"Deep reinforcement learning for solving resource constrained project scheduling problems with resource disruptions","volume":"85","author":"Cai","year":"2024","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107576_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107221","article-title":"Solving the online batching problem using deep reinforcement learning","volume":"156","author":"Cals","year":"2021","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.cor.2026.107576_b5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.ejor.2006.06.018","article-title":"A mixed integer programming model for advanced planning and scheduling (APS)","volume":"181","author":"Chen","year":"2007","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107576_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.124589","article-title":"Deep reinforcement learning driven cost minimization for batch order scheduling in robotic mobile fulfillment systems","volume":"255","author":"Cheng","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107576_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117489","article-title":"Robust scheduling for flexible machining job shop subject to machine breakdowns and new job arrivals considering system reusability and task recurrence","volume":"203","author":"Duan","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"24","key":"10.1016\/j.cor.2026.107576_b8","doi-asserted-by":"crossref","first-page":"7395","DOI":"10.1080\/00207540903433858","article-title":"A discrete time reactive scheduling model for new order insertion in job shop, make-to-order industries","volume":"48","author":"Gomes","year":"2010","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107576_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109255","article-title":"Dynamic scheduling for flexible job shop using a deep reinforcement learning approach","volume":"180","author":"Gui","year":"2023","journal-title":"Comput. Ind. Eng."},{"issue":"16","key":"10.1016\/j.cor.2026.107576_b10","doi-asserted-by":"crossref","first-page":"4903","DOI":"10.1080\/00207543.2015.1005246","article-title":"On the economic lot scheduling problem: stock-out prevention and system feasibility","volume":"53","author":"Hanson","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107576_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111699","article-title":"Mixed-batch scheduling to minimize total tardiness using deep reinforcement learning","volume":"160","author":"Huang","year":"2024","journal-title":"Appl. Soft Comput."},{"issue":"13","key":"10.1016\/j.cor.2026.107576_b12","doi-asserted-by":"crossref","first-page":"4086","DOI":"10.1080\/00207543.2019.1641643","article-title":"A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance","volume":"58","author":"Huang","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107576_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2020.120527","article-title":"Dynamic production scheduling model under due date uncertainty in precast concrete construction","volume":"257","author":"Kim","year":"2020","journal-title":"J. Clean. Prod."},{"issue":"1","key":"10.1016\/j.cor.2026.107576_b14","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1109\/TII.2023.3272661","article-title":"Large-scale dynamic scheduling for flexible job-shop with random arrivals of new jobs by hierarchical reinforcement learning","volume":"20","author":"Lei","year":"2023","journal-title":"IEEE Trans. Ind. Inform."},{"key":"10.1016\/j.cor.2026.107576_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106544","article-title":"An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem","volume":"95","author":"Li","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107576_b16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ins.2015.07.040","article-title":"Heuristics for periodical batch job scheduling in a MapReduce computing framework","volume":"326","author":"Li","year":"2016","journal-title":"Inform. Sci."},{"issue":"3","key":"10.1016\/j.cor.2026.107576_b17","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1007\/s10845-023-02094-4","article-title":"A two-stage RNN-based deep reinforcement learning approach for solving the parallel machine scheduling problem with due dates and family setups","volume":"35","author":"Li","year":"2024","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107576_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2024.102834","article-title":"Multi-agent deep reinforcement learning for dynamic reconfigurable shop scheduling considering batch processing and worker cooperation","volume":"91","author":"Li","year":"2025","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107576_b19","article-title":"Dynamic job-shop scheduling via graph attention networks and deep reinforcement learning","author":"Liu","year":"2024","journal-title":"IEEE Trans. Ind. Inform."},{"issue":"6\u20137","key":"10.1016\/j.cor.2026.107576_b20","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.compchemeng.2006.02.008","article-title":"State-of-the-art review of optimization methods for short-term scheduling of batch processes","volume":"30","author":"M\u00e9ndez","year":"2006","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"10.1016\/j.cor.2026.107576_b21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1008923215028","article-title":"Annealed importance sampling","volume":"11","author":"Neal","year":"2001","journal-title":"Stat. Comput."},{"issue":"4","key":"10.1016\/j.cor.2026.107576_b22","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s10845-012-0626-9","article-title":"A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates","volume":"24","author":"Nie","year":"2013","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"10.1016\/j.cor.2026.107576_b23","first-page":"390","article-title":"Mathematical models for a batch scheduling problem to minimize earliness and tardiness","volume":"11","author":"Ogun","year":"2018","journal-title":"J. Ind. Eng. Manag. (JIEM)"},{"issue":"2","key":"10.1016\/j.cor.2026.107576_b24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1108\/JMTM-05-2016-0064","article-title":"Application of Petri nets towards improved utilization of machines in job shop manufacturing environments","volume":"28","author":"Pachpor","year":"2017","journal-title":"J. Manuf. Technol. Manag."},{"key":"10.1016\/j.cor.2026.107576_b25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.cor.2016.12.001","article-title":"Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system","volume":"80","author":"Parsa","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107576_b26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.omega.2017.12.003","article-title":"A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers","volume":"82","author":"Pei","year":"2019","journal-title":"Omega"},{"issue":"1","key":"10.1016\/j.cor.2026.107576_b27","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ejor.2014.11.034","article-title":"Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan","volume":"244","author":"Pei","year":"2015","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107576_b28","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.107576_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.109985","article-title":"A novel predictive\u2013reactive scheduling method for parallel batch processor lot-sizing and scheduling with sequence-dependent setup time","volume":"189","author":"Qiu","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107576_b30","series-title":"International Conference on Machine Learning","first-page":"1889","article-title":"Trust region policy optimization","author":"Schulman","year":"2015"},{"key":"10.1016\/j.cor.2026.107576_b31","series-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"10.1016\/j.cor.2026.107576_b32","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2016.07.021","article-title":"An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes","volume":"77","author":"Shahvari","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"1\u20132","key":"10.1016\/j.cor.2026.107576_b33","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1080\/00207543.2017.1401247","article-title":"Customer order scheduling on batch processing machines with incompatible job families","volume":"56","author":"Shi","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107576_b34","doi-asserted-by":"crossref","first-page":"84","DOI":"10.14716\/ijtech.v6i1.783","article-title":"The batch scheduling model for dynamic multi-item, multi-level production in an assembly job shop with parallel machines","volume":"1","author":"Surjandari","year":"2015","journal-title":"Int. J. Technol."},{"issue":"4","key":"10.1016\/j.cor.2026.107576_b35","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s12293-019-00296-z","article-title":"Genetic algorithms with greedy strategy for green batch scheduling on non-identical parallel machines","volume":"11","author":"Tan","year":"2019","journal-title":"Memetic Comput."},{"key":"10.1016\/j.cor.2026.107576_b36","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.jmsy.2018.01.006","article-title":"Data-driven smart manufacturing","volume":"48","author":"Tao","year":"2018","journal-title":"J. Manuf. Syst."},{"issue":"4","key":"10.1016\/j.cor.2026.107576_b37","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.eng.2019.01.014","article-title":"Digital twins and cyber\u2013physical systems toward smart manufacturing and industry 4.0: Correlation and comparison","volume":"5","author":"Tao","year":"2019","journal-title":"Engineering"},{"issue":"1","key":"10.1016\/j.cor.2026.107576_b38","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10479-023-05541-w","article-title":"A machine learning enhanced multi-start heuristic to efficiently solve a serial-batch scheduling problem","volume":"338","author":"Uzunoglu","year":"2024","journal-title":"Ann. Oper. Res."},{"issue":"13","key":"10.1016\/j.cor.2026.107576_b39","doi-asserted-by":"crossref","first-page":"4793","DOI":"10.1080\/00207543.2023.2279145","article-title":"An adaptive artificial bee colony for hybrid flow shop scheduling with batch processing machines in casting process","volume":"62","author":"Wang","year":"2024","journal-title":"Int. J. Prod. Res."},{"issue":"16","key":"10.1016\/j.cor.2026.107576_b40","doi-asserted-by":"crossref","first-page":"4381","DOI":"10.1080\/00207543.2011.592158","article-title":"Intelligent dynamic control of stochastic economic lot scheduling by agent-based reinforcement learning","volume":"50","author":"Wang","year":"2012","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107576_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.126441","article-title":"Multi-agent deep reinforcement learning-based approach for dynamic flexible assembly job shop scheduling with uncertain processing and transport times","volume":"270","author":"Wang","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107576_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110018","article-title":"Dynamic scheduling of decentralized high-end equipment R&D projects via deep reinforcement learning","volume":"190","author":"Wang","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107576_b43","series-title":"2025 8th International Conference on Advanced Algorithms and Control Engineering","first-page":"2065","article-title":"Research on edge computing and cloud collaborative resource scheduling optimization based on deep reinforcement learning","author":"Wang","year":"2025"},{"key":"10.1016\/j.cor.2026.107576_b44","first-page":"279","article-title":"Q-learning","volume":"8","author":"Watkins","year":"1992","journal-title":"Mach. Learn."},{"key":"10.1016\/j.cor.2026.107576_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.107790","article-title":"A deep reinforcement learning model for dynamic job-shop scheduling problem with uncertain processing time","volume":"131","author":"Wu","year":"2024","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cor.2026.107576_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.111310","article-title":"Deep reinforcement learning approach for a dynamic flexible job shop problem with sequence dependent setup times","author":"Yan","year":"2025","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107576_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101660","article-title":"Two-stage double deep Q-network algorithm considering external non-dominant set for multi-objective dynamic flexible job shop scheduling problems","volume":"90","author":"Yue","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107576_b48","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1007\/s10845-017-1350-2","article-title":"Review of job shop scheduling research and its new perspectives under industry 4.0","volume":"30","author":"Zhang","year":"2019","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107576_b49","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1007\/s00170-006-0662-8","article-title":"Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-learning","volume":"34","author":"Zhang","year":"2007","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2026.107576_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2022.102412","article-title":"Dynamic job shop scheduling based on deep reinforcement learning for multi-agent manufacturing systems","volume":"78","author":"Zhang","year":"2022","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"1","key":"10.1016\/j.cor.2026.107576_b51","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/TASE.2020.3027532","article-title":"Heuristic scheduling of batch production processes based on petri nets and iterated greedy algorithms","volume":"19","author":"Zhao","year":"2020","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"5","key":"10.1016\/j.cor.2026.107576_b52","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/J.ENG.2017.05.015","article-title":"Intelligent manufacturing in the context of industry 4.0: a review","volume":"3","author":"Zhong","year":"2017","journal-title":"Engineering"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001942?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001942?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T11:33:58Z","timestamp":1784892838000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":52,"alternative-id":["S0305054826001942"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107576","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Deep reinforcement learning for workpieces heat treatment batch scheduling considering compatibility-dependent setup times","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107576","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":"107576"}}