{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T18:55:00Z","timestamp":1772736900781,"version":"3.50.1"},"reference-count":37,"publisher":"Informa UK Limited","issue":"18","funder":[{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["C24\/17\/048"],"award-info":[{"award-number":["C24\/17\/048"]}],"id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2025,9,17]]},"DOI":"10.1080\/00207543.2025.2478434","type":"journal-article","created":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T01:29:06Z","timestamp":1742002146000},"page":"6606-6629","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["A fast and scalable deepest-left-bottom-fill algorithm to solve irregular 3D cutting and packing problems using a semi-discrete representation"],"prefix":"10.1080","volume":"63","author":[{"given":"Sahar","family":"Chehrazad","sequence":"first","affiliation":[{"name":"KU Leuven","place":["Leuven, Belgium"]}]},{"given":"Dirk","family":"Roose","sequence":"additional","affiliation":[{"name":"KU Leuven","place":["Leuven, Belgium"]}]},{"given":"Tony","family":"Wauters","sequence":"additional","affiliation":[{"name":"KU Leuven","place":["Gent, Belgium"]}]}],"member":"301","published-online":{"date-parts":[[2025,3,14]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2012.751508"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.09.023"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.11.038"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0456-5"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0192-0"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00055-2"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0293"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2018.10.009"},{"key":"e_1_3_4_10_1","volume-title":"Parallel Programming in OpenMP","author":"Chandra Rohit","year":"2001","unstructured":"Chandra, Rohit, Leonardo Dagum, Dave Kohr, Dror Maydan, Jeff McDonald, and Ramesh Menon. 2001. Parallel Programming in OpenMP. San Diego: Academic Press."},{"key":"e_1_3_4_11_1","unstructured":"Chehrazad S. 2024. \u201cAlgorithms to Solve 2D and 3D Irregular Cutting and Packing Problems Using a Semi-Discrete Representation.\u201d PhD diss. KULeuven. https:\/\/lirias.kuleuven.be\/handle\/20.500.12942\/734509."},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.10.043"},{"key":"e_1_3_4_13_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2816795.2818087","article-title":"Dapper: Decompose-And-pack for 3D Printing","volume":"34","author":"Chen X.","year":"2015","unstructured":"Chen, X., H. Zhang, J. Lin, R. Hu, L. Lu, Q. Huang, B. Benes, D. Cohen-Or, and B. Chen. 2015. \u201cDapper: Decompose-And-pack for 3D Printing.\u201d ACM Transactions on Graphics 34:1\u201312.","journal-title":"ACM Transactions on Graphics"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.06.063"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLEI.2012.6427153"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.04.020"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540701277002"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00130-3"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.009"},{"key":"e_1_3_4_20_1","volume-title":"Introduction to High Performance Computing for Scientists and Engineers","author":"Hager G.","year":"2011","unstructured":"Hager, G., and G. Wellein. 2011. Introduction to High Performance Computing for Scientists and Engineers. Boca Raton, FL: Chapman and Hall\/CRC."},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-0136(01)00581-7"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.07.036"},{"key":"e_1_3_4_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30198-1_45"},{"issue":"4","key":"e_1_3_4_24_1","first-page":"1","article-title":"Voxel-Based Solution Approaches to the Three-DimensionalIrregular Packing Problem","volume":"71","author":"Lamas-Fernandez C.","year":"2022","unstructured":"Lamas-Fernandez, C., J. A. Bennell, and A. Martinez-Sykora. 2022. \u201cVoxel-Based Solution Approaches to the Three-DimensionalIrregular Packing Problem.\u201d Operations Research 71 (4): 1\u201320.","journal-title":"Operations Research"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1041571"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.04.045"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2019.11.499"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1631\/FITEE.1400421"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.09.002"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2006.874973"},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00132-7"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331930500050681"},{"key":"e_1_3_4_33_1","first-page":"215","article-title":"Packing Non-Convex Polytopes into a Parallelepiped","volume":"54","author":"Stoyan Y. G.","year":"2005","unstructured":"Stoyan, Y. G., N. I. Gil, G. Scheithauer, A. Pankratov, and I. Magdalina. 2005. \u201cPacking Non-Convex Polytopes into a Parallelepiped.\u201d A Journal of Mathematical Programming and Operations Research54:215\u2013235.","journal-title":"A Journal of Mathematical Programming and Operations Research"},{"key":"e_1_3_4_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.047"},{"key":"e_1_3_4_35_1","unstructured":"Wu S. M. Kay R. King and A. Vila-Parrish. 2014. \u201cMulti-Objective Optimization of 3D Packing Problem in Additive Manufacturing.\u201d\u00a02014 Industrial and Systems Engineering Research Conference Palais des Congr\u00e9s de Montr\u00e9al Montr\u00e9al Canada May 31\u2013June 3 2014."},{"key":"e_1_3_4_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818064"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0736-5845(01)00022-9"},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.2016.23.issue-1-2"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2025.2478434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T17:57:04Z","timestamp":1772733424000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2025.2478434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,14]]},"references-count":37,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2025,9,17]]}},"alternative-id":["10.1080\/00207543.2025.2478434"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2025.2478434","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,14]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-11-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}