{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T04:00:43Z","timestamp":1776139243279,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"16","license":[{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10489-025-06949-6","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:25:21Z","timestamp":1761719121000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning to schedule dynamic job-shop problems by graph attention network with reinforcement learning"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3740-4500","authenticated-orcid":false,"given":"Chao","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibo","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,29]]},"reference":[{"key":"6949_CR1","doi-asserted-by":"crossref","unstructured":"Abidi MH, Alkhalefah H, Mohammed MK, Umer U, Qudeiri JEA, (2020) Optimal scheduling of flexible manufacturing system using improved lion-based hybrid machine learning approach. IEEE Access 8:96088\u201396114","DOI":"10.1109\/ACCESS.2020.2997663"},{"key":"6949_CR2","unstructured":"Andrychowicz M, Raichuk A, Sta\u0144czyk P, Orsini M, Girgin S, Marinier R, Hussenot L, Geist M, Pietquin O, Michalski M et\u00a0al (2020) What matters for on-policy deep actor-critic methods? a large-scale study. In: International conference on learning representations"},{"key":"6949_CR3","doi-asserted-by":"crossref","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290:405\u2013421","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"6949_CR4","doi-asserted-by":"crossref","unstructured":"Chen S, Huang Z, Guo H (2022) An end-to-end deep learning method for dynamic job shop scheduling problem. Machines 10:573","DOI":"10.3390\/machines10070573"},{"key":"6949_CR5","unstructured":"Chen X, Tian Y (2019) Learning to perform local rewriting for combinatorial optimization. Adv Neural Inform Process Syst 32"},{"key":"6949_CR6","doi-asserted-by":"crossref","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6:182\u2013197","DOI":"10.1109\/4235.996017"},{"key":"6949_CR7","doi-asserted-by":"crossref","unstructured":"Demirkol E, Mehta S, Uzsoy R (1998) Benchmarks for shop scheduling problems. Eur J Oper Res 109:137\u2013141","DOI":"10.1016\/S0377-2217(97)00019-2"},{"key":"6949_CR8","doi-asserted-by":"crossref","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117\u2013129","DOI":"10.1287\/moor.1.2.117"},{"key":"6949_CR9","unstructured":"Kai-Wen L, Tao Z, Rui W, Wei-Jian Q, Hui-Hui H, Hong H (2021) Research reviews of combinatorial optimization methods based on deep reinforcement learning. Acta Autom Sin 47:2521\u20132537"},{"key":"6949_CR10","doi-asserted-by":"crossref","unstructured":"Jumper J, Evans R, Pritzel A, Green T, Figurnov M, Ronneberger O, Tunyasuvunakool K, Bates R, \u017d\u00eddek A, Potapenko A et\u00a0al (2021) Highly accurate protein structure prediction with alphafold. Nature 596:583\u2013589","DOI":"10.1038\/s41586-021-03819-2"},{"key":"6949_CR11","doi-asserted-by":"crossref","unstructured":"Kawaguchi S, Fukuyama Y (2016) Reactive tabu search for job-shop scheduling problems. In: 2016 11th International Conference on Computer Science & Education (ICCSE), IEEE. pp. 97\u2013102","DOI":"10.1109\/ICCSE.2016.7581562"},{"key":"6949_CR12","doi-asserted-by":"crossref","unstructured":"Kim GH, Lee CG (1995) Genetic reinforcement learning approach to the machine scheduling problem. In: Proceedings of 1995 IEEE international conference on robotics and automation, IEEE. pp 196\u2013201","DOI":"10.1109\/ROBOT.1995.525285"},{"key":"6949_CR13","doi-asserted-by":"crossref","unstructured":"Kotary J, Fioretto F, Van\u00a0Hentenryck P (2022) Fast approximations for job shop scheduling: A lagrangian dual deep learning method. In: Proceedings of the AAAI conference on artificial intelligence, pp 7239\u20137246","DOI":"10.1609\/aaai.v36i7.20685"},{"key":"6949_CR14","doi-asserted-by":"crossref","unstructured":"Liu CL, Chang CC, Tseng CJ (2020) Actor-critic deep reinforcement learning for solving job shop scheduling problems. Ieee Access 8:71752\u201371762","DOI":"10.1109\/ACCESS.2020.2987820"},{"key":"6949_CR15","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller M (2013) Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602"},{"key":"6949_CR16","doi-asserted-by":"crossref","unstructured":"M\u00fcller D, M\u00fcller MG, Kress D, Pesch E (2022) An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning. Eur J Oper Res 302:874\u2013891","DOI":"10.1016\/j.ejor.2022.01.034"},{"key":"6949_CR17","doi-asserted-by":"crossref","unstructured":"Park J, Chun J, Kim SH, Kim Y, Park J (2021) Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning. Int J Prod Res 59:3360\u20133377","DOI":"10.1080\/00207543.2020.1870013"},{"key":"6949_CR18","unstructured":"Riedmiller S, Riedmiller M (1999) A neural reinforcement learning approach to learn local dispatching policies in production scheduling. In: IJCAI, Citeseer. pp 764\u2013771"},{"key":"6949_CR19","unstructured":"Schulman J, Wolski F, Dhariwal P, Radford A, Klimov O (2017) Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347"},{"key":"6949_CR20","doi-asserted-by":"crossref","unstructured":"Sels V, Gheysen N, Vanhoucke M (2012) A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions. Int J Prod Res 50:4255\u20134270","DOI":"10.1080\/00207543.2011.611539"},{"key":"6949_CR21","doi-asserted-by":"crossref","unstructured":"Shao X, Kim CS (2022) An adaptive job shop scheduler using multilevel convolutional neural network and iterative local search. IEEE Access 10:88079\u201388092","DOI":"10.1109\/ACCESS.2022.3188765"},{"key":"6949_CR22","doi-asserted-by":"crossref","unstructured":"Silver D, Schrittwieser J, Simonyan K, Antonoglou I, Huang A, Guez A, Hubert T, Baker L, Lai M, Bolton A et\u00a0al (2017) Mastering the game of go without human knowledge. Nature 550:354\u2013359","DOI":"10.1038\/nature24270"},{"key":"6949_CR23","doi-asserted-by":"crossref","unstructured":"Song W, Chen X, Li Q, Cao Z (2022) Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Trans Ind Inform 19:1600\u20131610","DOI":"10.1109\/TII.2022.3189725"},{"key":"6949_CR24","doi-asserted-by":"crossref","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278\u2013285","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"6949_CR25","doi-asserted-by":"crossref","unstructured":"Vaessens RJM, Aarts EHL, Lenstra JK (1996) Job shop scheduling by local search. Inform J Comput 8:302\u2013317","DOI":"10.1287\/ijoc.8.3.302"},{"key":"6949_CR26","doi-asserted-by":"publisher","unstructured":"Vaidya S, Ambad P, Bhosle S (2018) Industry 4.0 \u2013 a glimpse. Procedia Manufacturing 20, 233\u2013238. 2nd International conference on materials, manufacturing and design engineering (iCMMD2017), 11\u201312 December 2017, MIT Aurangabad, Maharashtra, INDIA. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2351978918300672. https:\/\/doi.org\/10.1016\/j.promfg.2018.02.034","DOI":"10.1016\/j.promfg.2018.02.034"},{"key":"6949_CR27","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. Adv Neural Inform Process Syst 28"},{"key":"6949_CR28","doi-asserted-by":"crossref","unstructured":"Wang L, Hu X, Wang Y, Xu S, Ma S, Yang K, Liu Z, Wang W (2021) Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning. Comput Netw 190:107969","DOI":"10.1016\/j.comnet.2021.107969"},{"key":"6949_CR29","doi-asserted-by":"publisher","unstructured":"Yuan Y, Xu H (2015) Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans Autom Sci Eng 12:336\u2013353. https:\/\/doi.org\/10.1109\/TASE.2013.2274517","DOI":"10.1109\/TASE.2013.2274517"},{"key":"6949_CR30","unstructured":"Zhang C, Song W, Cao Z, Zhang J, Tan PS, Chi X (2020) Learning to dispatch for job shop scheduling via deep reinforcement learning. Adv Neural Inform Process Syst 33:1621\u20131632"},{"key":"6949_CR31","doi-asserted-by":"crossref","unstructured":"Zhang H, Zeng Z, Lu K, Wu K, Zhang S (2022) Efficient dialog policy learning by reasoning with contextual knowledge. In: Proceedings of the AAAI conference on artificial intelligence, pp 11667\u201311675","DOI":"10.1609\/aaai.v36i10.21421"},{"key":"6949_CR32","unstructured":"Zheng P, Zuo L, Wang J, Zhang J (2018) Pointer networks for solving the permutation flow shop scheduling problem, in: Proceedings of the 48th international conference on computers & industrial engineering (CIE48). Auckland, New Zealand, pp 2\u20135"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06949-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06949-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06949-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T08:05:17Z","timestamp":1764144317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06949-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,29]]},"references-count":32,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["6949"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06949-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,29]]},"assertion":[{"value":"2 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"1061"}}