{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T21:26:48Z","timestamp":1758058008107,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032051783","type":"print"},{"value":"9783032051790","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05179-0_4","type":"book-chapter","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T21:43:34Z","timestamp":1757972614000},"page":"41-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing 2D Packing Strategies for\u00a0Autoclave Loading Using Deep Reinforcement Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7388-2441","authenticated-orcid":false,"given":"Victor U.","family":"Pugliese","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3008-7322","authenticated-orcid":false,"given":"Diogo S.","family":"Carvalho","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4066-8709","authenticated-orcid":false,"given":"Oseias F.","family":"Ferreira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2956-6326","authenticated-orcid":false,"given":"Fabio A.","family":"Faria","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5705-7372","authenticated-orcid":false,"given":"Francisco S.","family":"Melo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2023.102918","volume":"120","author":"V Haskilic","year":"2023","unstructured":"Haskilic, V., Ulucan, A., Atici, K.B., Sarac, S.B.: A real-world case of autoclave loading and scheduling problems in aerospace composite material production. Omega 120, 102918 (2023)","journal-title":"Omega"},{"key":"4_CR2","unstructured":"K\u0131rdar, G.: Opt\u0131m\u0131zat\u0131on of compos\u0131te parts placement in autoclave (2020)"},{"key":"4_CR3","unstructured":"Azami, A.: Scheduling Hybrid Flow Lines of Aerospace Composite Manufacturing Systems. PhD thesis, Concordia University (2016)"},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105381","volume":"133","author":"S Zheng","year":"2021","unstructured":"Zheng, S., Xie, N., Qiao, W.: Single batch machine scheduling with dual setup times for autoclave molding manufacturing. Comput. Oper. Res. 133, 105381 (2021)","journal-title":"Comput. Oper. Res."},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106599","volume":"146","author":"N Xie","year":"2020","unstructured":"Xie, N., Zheng, S., Qiao, W.: Two-dimensional packing algorithm for autoclave molding scheduling of aeronautical composite materials production. Comput. Ind. Eng. 146, 106599 (2020)","journal-title":"Comput. Ind. Eng."},{"issue":"1\u20132","key":"4_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1111\/itor.12295","volume":"24","author":"M Dios","year":"2017","unstructured":"Dios, M., Gonzalez-R, P.L., Dios, D., Maffezzoli, A.: A mathematical modeling approach to optimize composite parts placement in autoclave. Int. Trans. Oper. Res. 24(1\u20132), 115\u2013141 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"4_CR7","unstructured":"Tang, T.Y.: Exact and Heuristic Approaches to Batching-and-Scheduling for the Composites Manufacturing Problem. University of Toronto (Canada) (2020)"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1007\/s10845-022-01915-2","volume":"33","author":"C Waubert de Puiseau","year":"2022","unstructured":"Waubert de Puiseau, C., Meyes, R., Meisen, T.: On reliability of reinforcement learning based production scheduling systems: a comparative survey. J. Intell. Manuf. 33(4), 911\u2013927 (2022). https:\/\/doi.org\/10.1007\/s10845-022-01915-2","journal-title":"J. Intell. Manuf."},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"760","DOI":"10.3390\/pr10040760","volume":"10","author":"J Chang","year":"2022","unstructured":"Chang, J., Dong, Yu., Yi, H., He, W., Haoyu, Yu.: Deep reinforcement learning for dynamic flexible job shop scheduling with random job arrival. Processes 10(4), 760 (2022)","journal-title":"Processes"},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107683","volume":"235","author":"D Li","year":"2022","unstructured":"Li, D., Gu, Z., Wang, Y., Ren, C., Lau, F.C.: One model packs thousands of items with recurrent conditional query learning. Knowl.-Based Syst. 235, 107683 (2022)","journal-title":"Knowl.-Based Syst."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Kundu, O., Dutta, S., Kumar, S.: Deep-pack: a vision-based 2d online bin packing algorithm with deep reinforcement learning. In: 2019 28th IEEE International Conference on Robot and Human Interactive Communication (RO-MAN), pp. 1\u20137. IEEE (2019)","DOI":"10.1109\/RO-MAN46459.2019.8956393"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0282598","volume":"18","author":"J Fang","year":"2023","unstructured":"Fang, J., Rao, Y., Shi, M.: A deep reinforcement learning algorithm for the rectangular strip packing problem. PLoS ONE 18(3), e0282598 (2023)","journal-title":"PLoS ONE"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.3390\/math11020327","volume":"11","author":"J Fang","year":"2023","unstructured":"Fang, J., Rao, Y., Zhao, X., Bing, D.: A hybrid reinforcement learning algorithm for 2d irregular packing problems. Mathematics 11(2), 327 (2023)","journal-title":"Mathematics"},{"issue":"03","key":"4_CR14","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S1793351X24430025","volume":"18","author":"V Crescitelli","year":"2024","unstructured":"Crescitelli, V., Oshima, T.: Optimization of 2D irregular packing: deep reinforcement learning with dense reward. Int. J. Semant. Comput. 18(03), 405\u2013416 (2024)","journal-title":"Int. J. Semant. Comput."},{"issue":"6","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3618349","volume":"42","author":"Z Yang","year":"2023","unstructured":"Yang, Z., Pan, Z., Li, M., Kui, W., Gao, X.: Learning based 2d irregular shape packing. ACM Trans. Graph. (TOG) 42(6), 1\u201316 (2023)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"4_CR16","unstructured":"Hill, A., et al.: Stable baselines (2018). https:\/\/github.com\/hill-a\/stable-baselines"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Sun, Y., Yuan, X., Liu, W., Sun, C.: Model-based reinforcement learning via proximal policy optimization. In: 2019 Chinese Automation Congress (CAC), pp. 4736\u20134740. IEEE (2019)","DOI":"10.1109\/CAC48633.2019.8996875"},{"key":"4_CR18","unstructured":"Brockman, G., et al.: Openai gym (2016)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Crescitelli, V., Oshima, T.: A deep reinforcement learning method for 2d irregular packing with dense reward. In: 2023 Fifth International Conference on Transdisciplinary AI (TransAI), pp. 270\u2013271. IEEE (2023)","DOI":"10.1109\/TransAI60598.2023.00037"},{"key":"4_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105693","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems\u2013an overview of recent advances. part ii: Multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res. 143, 105693 (2022)","journal-title":"Comput. Oper. Res."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: a survey. J. Artif. Intell. Res. 4, 237\u2013285 (1996)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR22","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT press, Cambridge (2018)"},{"key":"4_CR23","unstructured":"FrameWork Keras. PPO proximal policy optimization (2022)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Bandaru, S., Deb, K.: Metaheuristic techniques. In: Decision Sciences, pp. 709\u2013766. CRC Press (2016)","DOI":"10.1201\/9781315183176-12"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Sastry, K., Goldberg, D., Kendall, G.: Genetic algorithms. In: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 97\u2013125 (2005)","DOI":"10.1007\/0-387-28356-0_4"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05179-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T21:43:39Z","timestamp":1757972619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05179-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"ISBN":["9783032051783","9783032051790"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05179-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,16]]},"assertion":[{"value":"16 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Faro","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2025.ualg.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}