{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T21:45:44Z","timestamp":1785879944678,"version":"3.56.0"},"reference-count":27,"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\/501100009103","name":"Education Department of Shaanxi Province","doi-asserted-by":"publisher","award":["25JS125"],"award-info":[{"award-number":["25JS125"]}],"id":[{"id":"10.13039\/501100009103","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["D5000230340"],"award-info":[{"award-number":["D5000230340"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["G25KY0612609"],"award-info":[{"award-number":["G25KY0612609"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFF0905604"],"award-info":[{"award-number":["2023YFF0905604"]}],"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,10]]},"DOI":"10.1016\/j.cor.2026.107549","type":"journal-article","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T15:12:15Z","timestamp":1779376335000},"page":"107549","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Learning to solve single-batch-processing machine scheduling problem with two-dimensional packing constraints"],"prefix":"10.1016","volume":"194","author":[{"given":"Fan","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2218-8550","authenticated-orcid":false,"given":"Ziming","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kanxin","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingwen","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2180-8941","authenticated-orcid":false,"given":"Haobin","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2026.107549_b1","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1512\/iumj.1957.6.56038","article-title":"A Markovian decision process","volume":"6","author":"Bellman","year":"1957","journal-title":"Indiana Univ. Math. J."},{"key":"10.1016\/j.cor.2026.107549_b2","series-title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","author":"Chung","year":"2014"},{"key":"10.1016\/j.cor.2026.107549_b3","series-title":"A multi-task selected learning approach for solving 3D flexible bin packing problem","author":"Duan","year":"2018"},{"key":"10.1016\/j.cor.2026.107549_b4","first-page":"729","article-title":"A new model for learning in graph domains","volume":"vol. 2","author":"Gori","year":"2005"},{"issue":"3","key":"10.1016\/j.cor.2026.107549_b5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s11465-013-0248-8","article-title":"Additive manufacturing: Technology, applications and research needs","volume":"8","author":"Guo","year":"2013","journal-title":"Front. Mech. Eng."},{"key":"10.1016\/j.cor.2026.107549_b6","first-page":"140","article-title":"An online packing heuristic for the three-dimensional container loading problem in dynamic environments and the physical internet","volume":"vol. 10200","author":"Ha","year":"2017"},{"key":"10.1016\/j.cor.2026.107549_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105847","article-title":"Scheduling unrelated additive manufacturing machines with practical constraints","volume":"144","author":"Hu","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107549_b8","series-title":"Solving a new 3d bin packing problem with deep reinforcement learning method","author":"Hu","year":"2017"},{"key":"10.1016\/j.cor.2026.107549_b9","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2018","journal-title":"Int. Conf. Learn. Represent. OpenReview"},{"key":"10.1016\/j.cor.2026.107549_b10","first-page":"21188","article-title":"POMO: Policy optimization with multiple optima for reinforcement learning","volume":"vol. 33","author":"Kwon","year":"2020"},{"issue":"1","key":"10.1016\/j.cor.2026.107549_b11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0360-8352(96)00205-7","article-title":"Developing a simulated annealing algorithm for the cutting stock problem","volume":"32","author":"Lai","year":"1997","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107549_b12","series-title":"Ranked reward: Enabling self-play reinforcement learning for combinatorial optimization","author":"Laterre","year":"2018"},{"key":"10.1016\/j.cor.2026.107549_b13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ijpe.2017.11.015","article-title":"Single batch processing machine scheduling with two-dimensional bin packing constraints","volume":"196","author":"Li","year":"2018","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2026.107549_b14","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1016\/j.ins.2022.06.017","article-title":"A graph neural networks-based deep Q-learning approach for job shop scheduling problems in traffic management","volume":"607","author":"Liu","year":"2022","journal-title":"Inform. Sci."},{"key":"10.1016\/j.cor.2026.107549_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106208","article-title":"Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning","volume":"91","author":"Luo","year":"2020","journal-title":"Appl. Soft Comput."},{"issue":"9\u201310","key":"10.1016\/j.cor.2026.107549_b16","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","article-title":"A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor","volume":"29","author":"Mathirajan","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"18\u201320","key":"10.1016\/j.cor.2026.107549_b17","doi-asserted-by":"crossref","first-page":"6022","DOI":"10.1080\/00207543.2011.641358","article-title":"Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates","volume":"50","author":"Ozturk","year":"2012","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107549_b18","first-page":"1","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."},{"issue":"5","key":"10.1016\/j.cor.2026.107549_b19","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1145\/585265.585269","article-title":"On the online bin packing problem","volume":"49","author":"Seiden","year":"2002","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.cor.2026.107549_b20","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","article-title":"Flexible job-shop scheduling via graph neural network and deep reinforcement learning","volume":"19","author":"Song","year":"2022","journal-title":"IEEE Trans. Ind. Inform."},{"key":"10.1016\/j.cor.2026.107549_b21","first-page":"5998","article-title":"Attention is all you need","volume":"vol. 30","author":"Vaswani","year":"2017"},{"issue":"1","key":"10.1016\/j.cor.2026.107549_b22","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TR.2021.3128167","article-title":"An adaptive large neighborhood search for single-machine batch processing scheduling with 2-D rectangular bin-packing constraints","volume":"71","author":"Zeng","year":"2021","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.cor.2026.107549_b23","first-page":"1621","article-title":"Learning to dispatch for job shop scheduling via deep reinforcement learning","volume":"vol. 33","author":"Zhang","year":"2020"},{"key":"10.1016\/j.cor.2026.107549_b24","first-page":"741","article-title":"Online 3D bin packing with constrained deep reinforcement learning","volume":"vol. 35","author":"Zhao","year":"2021"},{"key":"10.1016\/j.cor.2026.107549_b25","unstructured":"Zhao, H., Yu, Y., Xu, K., 2021b. Learning Efficient Online 3D Bin Packing on Packing Configuration Trees. In: International Conference on Learning Representations."},{"key":"10.1016\/j.cor.2026.107549_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108167","article-title":"Minimizing makespan on parallel batch processing machines with two-dimensional rectangular jobs","volume":"169","author":"Zhou","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107549_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116907","article-title":"Scheduling a single batch processing machine with non-identical two-dimensional job sizes","volume":"201","author":"Zhou","year":"2022","journal-title":"Expert Syst. Appl."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505482600167X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505482600167X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T20:59:47Z","timestamp":1785877187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505482600167X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":27,"alternative-id":["S030505482600167X"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107549","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":"Learning to solve single-batch-processing machine scheduling problem with two-dimensional packing constraints","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107549","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107549"}}