{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:08:45Z","timestamp":1777043325610,"version":"3.51.4"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council (NSTC) of Taiwan","doi-asserted-by":"publisher","award":["112-2622-8-A49-021"],"award-info":[{"award-number":["112-2622-8-A49-021"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council (NSTC) of Taiwan","doi-asserted-by":"publisher","award":["111-2221-E-A49-101-MY2"],"award-info":[{"award-number":["111-2221-E-A49-101-MY2"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council (NSTC) of Taiwan","doi-asserted-by":"publisher","award":["110-2221-E-A49-067-MY3"],"award-info":[{"award-number":["110-2221-E-A49-067-MY3"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3357969","type":"journal-article","created":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T18:41:21Z","timestamp":1706121681000},"page":"14703-14718","source":"Crossref","is-referenced-by-count":21,"title":["Residual Scheduling: A New Reinforcement Learning Approach to Solving Job Shop Scheduling Problem"],"prefix":"10.1109","volume":"12","author":[{"given":"Kuo-Hao","family":"Ho","sequence":"first","affiliation":[{"name":"Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}]},{"given":"Jui-Yu","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}]},{"given":"Ji-Han","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}]},{"given":"Fan","family":"Chiang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}]},{"given":"Yen-Chi","family":"Chen","sequence":"additional","affiliation":[{"name":"Research Center for Information Technology Innovation, Academia Sinica, Taipei, Taiwan"}]},{"given":"Yuan-Yu","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2535-0587","authenticated-orcid":false,"given":"I-Chen","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1621","article-title":"Learning to dispatch for job shop scheduling via deep reinforcement learning","volume-title":"Proc. Neural Inf. Process. Syst. (NeurIPS)","author":"Zhang"},{"key":"ref2","first-page":"1","article-title":"Production scheduling in complex job shops from an industry 4.0 perspective: A review and challenges in the semiconductor industry","volume-title":"Proc. 1st Int. Workshop Sci., Appl. Methods Ind. 4.0 (i-KNOW)","volume":"1793","author":"Waschneck"},{"issue":"4","key":"ref3","first-page":"429","article-title":"Job shop scheduling: Classification, constraints and objective functions","volume":"11","author":"Abdolrazzagh-Nezhad","year":"2017","journal-title":"Int. J. Comput. Inf. Eng."},{"key":"ref4","volume-title":"Or-Tools","author":"Perron","year":"2019"},{"issue":"53","key":"ref5","first-page":"157","article-title":"V12. 1: User\u2019s manual for CPLEX","volume":"46","author":"Cplex","year":"2009","journal-title":"Int. Bus. Mach. Corp."},{"key":"ref6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.24.4.441"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-004-2296-z"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01721162"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/10719839_7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.02.014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.12.005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.05.168"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.01.136"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1724-z"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-05172-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-021-03544-w"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1049\/cim2.12072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2956762"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2908210"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106208"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1870013"},{"key":"ref25","article-title":"ScheduleNet: Learn to solve multi-agent scheduling problems with reinforcement learning","author":"Park","year":"2021","journal-title":"arXiv:2106.03051"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2022.3189725"},{"key":"ref27","article-title":"Learning to search for job shop scheduling via deep reinforcement learning","author":"Zhang","year":"2022","journal-title":"arXiv:2211.10936"},{"key":"ref28","article-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018","journal-title":"arXiv:1806.01261"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2983763"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref31","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Xu"},{"key":"ref32","first-page":"448","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"37","author":"Ioffe"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/tnn.1998.712192"},{"key":"ref34","first-page":"8024","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Neural Inf. Process. Syst. (NeurIPS)","author":"Paszke"},{"key":"ref35","article-title":"Fast graph representation learning with PyTorch geometric","volume-title":"Proc. ICLR Workshop Represent. Learn. Graphs Manifolds","author":"Fey"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF01719451"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.3.391"},{"key":"ref39","volume-title":"Industrial Scheduling","author":"Muth","year":"1963"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.2.149"},{"key":"ref41","first-page":"283","article-title":"A genetic algorithm applicable to large-scale job-shop problems","volume-title":"Parallel Problem Solving From Nature 2, (PPSN-II)","author":"Yamada","year":"1992"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.10.1495"},{"key":"ref43","article-title":"Resouce constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement)","author":"Lawrence","year":"1984"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023073"},{"key":"ref45","article-title":"Test instances for the flexible job shop scheduling problem with work centers","author":"Behnke","year":"2012"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10413475.pdf?arnumber=10413475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:43:54Z","timestamp":1706834634000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10413475\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3357969","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}