{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:45:00Z","timestamp":1767339900475},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p>This paper studies the use of Curriculum Learning on Reinforcement Learning (RL) to improve the performance of the dispatching policies learned on the Job-shop Scheduling Problem (JSP). Current works in the literature present a large optimality gap when learning end-to-end solutions on this problem. In this regard, we identify the difficulty for RL to learn directly on large instances as part of the issue and use Curriculum Learning (CL) to mitigate this effect. Particularly, CL sequences the learning process in a curriculum of increasing complexity tasks, which allows learning on large instances that otherwise would be impossible to learn from scratch. In this paper, we present a size-agnostic model that enables us to demonstrate that current curriculum strategies have a major impact on the quality of the solution inferred. In addition, we introduce a novel Reinforced Adaptive Staircase Curriculum Learning (RASCL) strategy, which adjusts the difficulty level during the learning process by revisiting the worst-performing instances. Conducted experiments on Taillard\u2019s and Demirkol\u2019s datasets show that the presented approach significantly improves the current stateof-the-art models on the JSP. It reduces the average optimality gap from 19.35% to 10.46% on Taillard\u2019s instances and from 38.43% to 18.85% on Demirkol\u2019s instances.<\/jats:p>","DOI":"10.24963\/ijcai.2023\/594","type":"proceedings-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T08:31:30Z","timestamp":1691742690000},"page":"5350-5358","source":"Crossref","is-referenced-by-count":5,"title":["On the Study of Curriculum Learning for Inferring Dispatching Policies on the Job Shop Scheduling"],"prefix":"10.24963","author":[{"given":"Zangir","family":"Iklassov","sequence":"first","affiliation":[{"name":"Mohamed bin Zayed University of Artificial Intelligence"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitrii","family":"Medvedev","sequence":"additional","affiliation":[{"name":"Mohamed bin Zayed University of Artificial Intelligence"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"Solozabal Ochoa de Retana","sequence":"additional","affiliation":[{"name":"Mohamed bin Zayed University of Artificial Intelligence"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Takac","sequence":"additional","affiliation":[{"name":"Mohamed bin Zayed University of Artificial Intelligence"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"32","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2023","name":"Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}","start":{"date-parts":[[2023,8,19]]},"theme":"Artificial Intelligence","location":"Macau, SAR China","end":{"date-parts":[[2023,8,25]]}},"container-title":["Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T08:52:07Z","timestamp":1691743927000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2023\/594"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2023\/594","relation":{},"subject":[],"published":{"date-parts":[[2023,8]]}}}