{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:50Z","timestamp":1740141890626,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UI\/297\/2020"],"award-info":[{"award-number":["UI\/297\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2019-0455"],"award-info":[{"award-number":["2019-0455"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10288-022-00522-4","type":"journal-article","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T06:03:31Z","timestamp":1661753011000},"page":"491-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2826-7220","authenticated-orcid":false,"given":"Manuel V. C.","family":"Vieira","sequence":"first","affiliation":[]},{"given":"Margarida","family":"Carvalho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"522_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.omega.2016.02.002","volume":"66","author":"MT Alonso","year":"2017","unstructured":"Alonso MT, Alvarez-Valdes R, Iori M, Parre\u00f1o F, Tamarit JM (2017) Mathematical models for multicontainer loading problems. Omega 66:106\u2013117","journal-title":"Omega"},{"issue":"2","key":"522_CR2","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.ejor.2020.03.040","volume":"286","author":"I Araya","year":"2020","unstructured":"Araya I, Moyano M, Sanchez C (2020) A beam search algorithm for the biobjective container loading problem. Eur J Oper Res 286(2):417\u2013431","journal-title":"Eur J Oper Res"},{"issue":"1","key":"522_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","volume":"229","author":"A Bortfeldt","year":"2013","unstructured":"Bortfeldt A, W\u00e4scher G (2013) Constraints in container loading - A state-of-the-art review. Eur J Oper Res 229(1):1\u201320","journal-title":"Eur J Oper Res"},{"key":"522_CR4","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.orl.2019.10.011","volume":"47","author":"S Coniglio","year":"2019","unstructured":"Coniglio S, D\u2019Andreagiovanni F, Furini F (2019) A lexicographic pricer or the fractional bin packing problem. Operat Res Lett 47:622\u2013628","journal-title":"Operat Res Lett"},{"issue":"1","key":"522_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(94)00002-T","volume":"80","author":"CS Chen","year":"1995","unstructured":"Chen CS, Lee SM, Shen QS (1995) An analytical model for the container loading problem. Eur J Oper Res 80(1):68\u201376","journal-title":"Eur J Oper Res"},{"issue":"1","key":"522_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cie.2013.05.016","volume":"66","author":"N Dahmani","year":"2013","unstructured":"Dahmani N, Clautiaux F, Krichen S, Talbi E (2013) Iterative approaches for solving a multi-objective 2-dimensional vector packing problem. Comput Ind Eng 66(1):158\u2013170","journal-title":"Comput Ind Eng"},{"issue":"1","key":"522_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme M, Iori M, Martello S (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur J Oper Res 255(1):1\u201320","journal-title":"Eur J Oper Res"},{"key":"522_CR8","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization. Springer-Verlag, Berlin Heidelberg"},{"issue":"13","key":"522_CR9","doi-asserted-by":"publisher","first-page":"5169","DOI":"10.1016\/j.eswa.2013.03.015","volume":"40","author":"A Fern\u00e1ndez","year":"2013","unstructured":"Fern\u00e1ndez A, Gil C, Ba\u00f1os R, Montoya MG (2013) A parallel multi-objective algorithm for two-dimensional bin packing with rotations and load balancing. Expert Syst Appl 40(13):5169\u20135180","journal-title":"Expert Syst Appl"},{"key":"522_CR10","unstructured":"M E Garey, D S Johnson (1990) Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA"},{"key":"522_CR11","unstructured":"Hessler K, Irnich S, Kreiter T, Pferschy U (2020) Lexicographic bin-packing optimization for loading trucks in a direct-shipping system. Discussion paper, Gutenberg School of Management and Economics"},{"issue":"5","key":"522_CR12","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1080\/0305215X.2016.1208010","volume":"49","author":"L Junqueira","year":"2017","unstructured":"Junqueira L, Morabito R (2017) On solving three-dimensional open-dimension rectangular packing problems. Eng Optim 49(5):733\u2013745","journal-title":"Eng Optim"},{"issue":"9","key":"522_CR13","doi-asserted-by":"publisher","first-page":"2122","DOI":"10.1016\/j.cor.2011.10.021","volume":"39","author":"A Khanafer","year":"2012","unstructured":"Khanafer A, Clautiaux F, Hanafi S, Talbi E (2012) The min-conflict packing problem. Comput Operat Res 39(9):2122\u20132132","journal-title":"Comput Operat Res"},{"issue":"15","key":"522_CR14","doi-asserted-by":"publisher","first-page":"4316","DOI":"10.1080\/00207543.2011.622309","volume":"50","author":"Y Liu","year":"2012","unstructured":"Liu Y, Chu C, Yu Y (2012) Aggregated state dynamic programming for a multiobjective two-dimensional bin packing problem. Int J Prod Res 50(15):4316\u20134325","journal-title":"Int J Prod Res"},{"issue":"12","key":"522_CR15","doi-asserted-by":"publisher","first-page":"3450","DOI":"10.1080\/00207543.2013.867083","volume":"52","author":"Y Liu","year":"2014","unstructured":"Liu Y, Chu C, Wu F (2014) A heuristic for variable size multiobjective two-dimensional bin packing. Int J Prod Res 52(12):3450\u20133465","journal-title":"Int J Prod Res"},{"issue":"2","key":"522_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ejor.2007.06.032","volume":"190","author":"DS Liu","year":"2008","unstructured":"Liu DS, Tan KC, Huang SY, Goh CK, Ho WK (2008) On solving multiobjective bin packing problems using evolutionary particle swarm optimization. Eur J Oper Res 190(2):357\u2013382","journal-title":"Eur J Oper Res"},{"key":"522_CR17","doi-asserted-by":"crossref","unstructured":"Meyer C, Floudas C (2004) Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. Front Glob Optimiz pp. 327-352","DOI":"10.1007\/978-1-4613-0251-3_18"},{"key":"522_CR18","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2019.04.020","volume":"109","author":"EF Silva","year":"2019","unstructured":"Silva EF, Toffolo TAM, Wauters T (2019) Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems. Comput Oper Res 109:12\u201327","journal-title":"Comput Oper Res"},{"key":"522_CR19","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1111\/itor.12099","volume":"23","author":"E Silva","year":"2016","unstructured":"Silva E, Oliveira JF, W\u00e4scher G (2016) The pallet loading problem: a review of solution methods and computational experiments. Int Trans Oper Res 23:147\u2013172","journal-title":"Int Trans Oper Res"},{"key":"522_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-018-9382-0","volume":"25","author":"KY Spencer","year":"2019","unstructured":"Spencer KY, Tsvetkov PV, Jarrell JJ (2019) A greedy memetic algorithm for a multiobjective dynamic bin packing problem for storing cooling objects. J Heuristics 25:1\u201345","journal-title":"J Heuristics"},{"issue":"2","key":"522_CR21","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.ejor.2016.07.033","volume":"257","author":"TAM Toffolo","year":"2017","unstructured":"Toffolo TAM, Esprit E, Wauters T, Vanden Berghe G (2017) A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. Eur J Oper Res 257(2):526\u2013538","journal-title":"Eur J Oper Res"},{"key":"522_CR22","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1080\/03052150600603264","volume":"38","author":"J-F Tsai","year":"2006","unstructured":"Tsai J-F, Li H-L (2006) A global optimization method for packing problems. Eng Optim 38:687\u2013700","journal-title":"Eng Optim"},{"issue":"12","key":"522_CR23","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1080\/02331934.2013.877906","volume":"64","author":"J-F Tsai","year":"2015","unstructured":"Tsai J-F, Wang P-C, Lin M-H (2015) A global optimization approach for solving three-dimensional open dimension rectangular packing problems. Optimization 64(12):2601\u20132618","journal-title":"Optimization"},{"issue":"4","key":"522_CR24","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1080\/01605682.2019.1700765","volume":"72","author":"MVC Vieira","year":"2021","unstructured":"Vieira MVC, Ferreira F, Duque J, Almeida R (2021) On the packing process in a shoe manufacturer. J Operat Res Soc 72(4):853\u2013864","journal-title":"J Operat Res Soc"},{"key":"522_CR25","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1080\/2058802X.2020.1805218","volume":"2020","author":"MVC Vieira","year":"2020","unstructured":"Vieira MVC, Ferreira F (2020) Packing Shoes Efficiently. Impact 2020:34\u201338","journal-title":"Impact"},{"issue":"1\u20132","key":"522_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1111\/itor.12094","volume":"23","author":"X Zhao","year":"2016","unstructured":"Zhao X, Bennell JA, Bektas T, Dowsland KA (2016) A comparative review of 3D container loading algorithms. Int Trans Oper Res 23(1\u20132):287\u2013320","journal-title":"Int Trans Oper Res"},{"key":"522_CR27","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.cie.2014.07.012","volume":"89","author":"J-N Zheng","year":"2015","unstructured":"Zheng J-N, Chien C-F, Gen M (2015) Multi-objective multi-population biased random-key genetic algorithm for the 3-D container loading problem. Comput Ind Eng 89:80\u201387","journal-title":"Comput Ind Eng"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00522-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-022-00522-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00522-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T18:03:40Z","timestamp":1695665020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-022-00522-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["522"],"URL":"https:\/\/doi.org\/10.1007\/s10288-022-00522-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"8 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}