{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:07:38Z","timestamp":1743113258946,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031740022"},{"type":"electronic","value":"9783031740039"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-74003-9_11","type":"book-chapter","created":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T07:01:43Z","timestamp":1735974103000},"page":"126-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forced Periodic Optimal Scheduling Policy for\u00a0Graph Reinforcement Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6285-8737","authenticated-orcid":false,"given":"Miguel S. E.","family":"Martins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7961-1004","authenticated-orcid":false,"given":"Susana","family":"Vieira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8030-4746","authenticated-orcid":false,"given":"Jo\u00e3o M. C.","family":"Sousa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,5]]},"reference":[{"key":"11_CR1","unstructured":"Andrychowicz, M., et al.: What Matters In On-Policy Reinforcement Learning? A Large-Scale Empirical Study (2020). http:\/\/arxiv.org\/abs\/2006.05990"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TII.2022.3167380","volume":"19","author":"R Chen","year":"2023","unstructured":"Chen, R., Li, W., Yang, H.: A deep reinforcement learning framework based on an attention mechanism and disjunctive graph embedding for the job-shop scheduling problem. IEEE Trans. Industr. Inf. 19(2), 1322\u20131331 (2023). https:\/\/doi.org\/10.1109\/TII.2022.3167380","journal-title":"IEEE Trans. Industr. Inf."},{"key":"11_CR3","unstructured":"Hamilton, W.L., Ying, R., Leskovec, J.: Inductive representation learning on large graphs. Adv. Neural Information Processing Systems 2017-Decem(Nips), 1025\u20131035 (2017)"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.2507\/IJSIMM20-2-CO7","volume":"20","author":"BA Han","year":"2021","unstructured":"Han, B.A., Yang, J.J.: A deep reinforcement learning based solution for flexible job shop scheduling problem. Int. J. Simul. Modell. 20(2), 375\u2013386 (2021). https:\/\/doi.org\/10.2507\/IJSIMM20-2-CO7","journal-title":"Int. J. Simul. Modell."},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Huang, S., Dossa, R.F.J., Ye, C., Braga, J., Chakraborty, D., Mehta, K., Ara\u00fajo, J.G.: CleanRL: High-quality Single-file Implementations of Deep Reinforcement Learning Algorithms. J. Mach. Learn. Res. 23(274), 1\u2014-18 (2022). https:\/\/doi.org\/10.48550\/arXiv.2111.08819","DOI":"10.48550\/arXiv.2111.08819"},{"key":"11_CR6","unstructured":"Lawrence, S.: An experimental investigation of heuristic scheduling techniques. Supplement to resource constrained project scheduling (1984)"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Liu, C.L., Chang, C.C., Tseng, C.J.: Actor-critic deep reinforcement learning for solving job shop scheduling problems. IEEE Access 8, 71752\u201371762 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2987820","DOI":"10.1109\/ACCESS.2020.2987820"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Liu, R., Piplani, R., Toro, C.: Deep reinforcement learning for dynamic scheduling of a flexible job shop. Int. J. Product. Res. 60(13), 4049\u20134069 (2022). https:\/\/doi.org\/10.1080\/00207543.2022.2058432","DOI":"10.1080\/00207543.2022.2058432"},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-023-09509-8","author":"MSE Martins","year":"2023","unstructured":"Martins, M.S.E., et al.: Minimizing total completion time in large-sized pharmaceutical quality control scheduling. J. Heurist. (2023). https:\/\/doi.org\/10.1007\/s10732-023-09509-8","journal-title":"J. Heurist."},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Park, J., Chun, J., Kim, S.H., Kim, Y., Park, J.: Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning. Int. J. Product. Res. 59(11), 3360\u20133377 (2021). https:\/\/doi.org\/10.1080\/00207543.2020.1870013","DOI":"10.1080\/00207543.2020.1870013"},{"key":"11_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer US, Boston, MA (2012). https:\/\/doi.org\/10.1007\/978-1-4614-2361-4"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1016\/j.aej.2021.01.030","volume":"60","author":"J Ren","year":"2021","unstructured":"Ren, J., Ye, C., Yang, F.: Solving flow-shop scheduling problem with a reinforcement learning algorithm that generalizes the value function with neural network. Alex. Eng. J. 60(3), 2787\u20132800 (2021). https:\/\/doi.org\/10.1016\/j.aej.2021.01.030","journal-title":"Alex. Eng. J."},{"key":"11_CR13","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal Policy Optimization Algorithms, pp. 1\u201312 (2017). http:\/\/arxiv.org\/abs\/1707.06347"},{"key":"11_CR14","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning. MIT Press (2020)"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Wang, L., et al.: Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning. Comput. Netw. 190(November 2020), 107969 (2021). https:\/\/doi.org\/10.1016\/j.comnet.2021.107969","DOI":"10.1016\/j.comnet.2021.107969"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Yang, S., Xu, Z.: Intelligent scheduling and reconfiguration via deep reinforcement learning in smart manufacturing. Int. J. Product. Res. 60(16), 4936\u20134953 (2022). https:\/\/doi.org\/10.1080\/00207543.2021.1943037","DOI":"10.1080\/00207543.2021.1943037"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Yang, Z., Bi, L., Jiao, X.: Combining reinforcement learning algorithms with graph neural networks to solve dynamic job shop scheduling problems. Processes 11(5) (2023). https:\/\/doi.org\/10.3390\/pr11051571","DOI":"10.3390\/pr11051571"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Yuan, E., Cheng, S., Wang, L., Song, S., Wu, F.: Solving job shop scheduling problems via deep reinforcement learning. Appl. Soft Comput. 143, 110436 (2023). https:\/\/doi.org\/10.1016\/j.asoc.2023.110436","DOI":"10.1016\/j.asoc.2023.110436"}],"container-title":["Lecture Notes in Networks and Systems","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74003-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T07:03:34Z","timestamp":1735974214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74003-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031740022","9783031740039"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74003-9_11","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPMU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisboa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipmu2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipmu2024.inesc-id.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}