{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:00:54Z","timestamp":1777561254654,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2020\/00747-2"],"award-info":[{"award-number":["2020\/00747-2"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0\u00ed Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["304144\/2019-3"],"award-info":[{"award-number":["304144\/2019-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s10878-024-01201-2","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:07:15Z","timestamp":1723028835000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Models for two-dimensional bin packing problems with customer order spread"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6722-7571","authenticated-orcid":false,"given":"Mateus","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horacio Hideki","family":"Yanasse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maristela O.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinaldo","family":"Morabito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,7]]},"reference":[{"key":"1201_CR1","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1080\/03052150902835960","volume":"41","author":"F Alvelos","year":"2009","unstructured":"Alvelos F, Chan T, Vila\u00e7a P, Gomes T, Silva E, Val\u00e9rio de Carvalho J (2009) Sequence based heuristics for two-dimensional bin packing problems. Eng Optim 41:773\u2013791. https:\/\/doi.org\/10.1080\/03052150902835960","journal-title":"Eng Optim"},{"key":"1201_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ejor.2020.09.023","volume":"291","author":"C Arbib","year":"2021","unstructured":"Arbib C, Marinelli F, Pizzuti A (2021) Number of bins and maximum lateness minimization in two-dimensional bin packing. Eur J Oper Res 291:101\u2013113. https:\/\/doi.org\/10.1016\/j.ejor.2020.09.023","journal-title":"Eur J Oper Res"},{"key":"1201_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1111\/itor.12134","volume":"23","author":"C Arbib","year":"2016","unstructured":"Arbib C, Marinelli F, Ventura P (2016) One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. Int Trans Oper Res 23:47\u201363. https:\/\/doi.org\/10.1111\/itor.12134","journal-title":"Int Trans Oper Res"},{"key":"1201_CR4","unstructured":"Baptiste P (2005). Simple MIP formulations to minimize the maximum number of open stacks. In Smith BM, & Gent IP (Eds.), Constraint modelling challenge 2005. Edinburgh. https:\/\/ipg.host.cs.st-andrews.ac.uk\/challenge\/"},{"key":"1201_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2582416","volume":"36","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36:297. https:\/\/doi.org\/10.2307\/2582416","journal-title":"J Oper Res Soc"},{"key":"1201_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33:49\u201364. https:\/\/doi.org\/10.1287\/opre.33.1.49","journal-title":"Oper Res"},{"key":"1201_CR7","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ijpe.2013.04.040","volume":"145","author":"JA Bennell","year":"2013","unstructured":"Bennell JA, Soon Lee L, Potts CN (2013) A genetic algorithm for two-dimensional bin packing with due dates. Int J Prod Econ 145:547\u2013560. https:\/\/doi.org\/10.1016\/j.ijpe.2013.04.040","journal-title":"Int J Prod Econ"},{"key":"1201_CR8","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"JO Berkey","year":"1987","unstructured":"Berkey JO, Wang PY (1987) Two-dimensional finite bin-packing algorithms. J Oper Res Soc 38:423\u2013429. https:\/\/doi.org\/10.1057\/jors.1987.70","journal-title":"J Oper Res Soc"},{"key":"1201_CR9","doi-asserted-by":"publisher","unstructured":"Boschetti MA, Mingozzi A (2003a). The two-dimensional finite bin packing problem-Part I: new lower bounds for the oriented case. 40(1), 27\u201342. https:\/\/doi.org\/10.1007\/s10288-002-0005-z","DOI":"10.1007\/s10288-002-0005-z"},{"key":"1201_CR10","doi-asserted-by":"publisher","unstructured":"Boschetti MA, Mingozzi A (2003b). The two-dimensional finite bin packing problem - Part II: new lower and upper bounds. 4OR, 1, 135\u2013147. https:\/\/doi.org\/10.1007\/s10288-002-0006-y","DOI":"10.1007\/s10288-002-0006-y"},{"key":"1201_CR11","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"EG Coffman Jr","year":"1980","unstructured":"Coffman EG Jr, Garey MR, Johnson DS, Tarjan RE (1980) Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J Comput 9:808\u2013826. https:\/\/doi.org\/10.1137\/0209062","journal-title":"SIAM J Comput"},{"key":"1201_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ejor.2014.06.032","volume":"240","author":"Y-P Cui","year":"2015","unstructured":"Cui Y-P, Cui Y, Tang T (2015) Sequential heuristic for the two-dimensional bin-packing problem. Eur J Oper Res 240:43\u201353. https:\/\/doi.org\/10.1016\/j.ejor.2014.06.032","journal-title":"Eur J Oper Res"},{"key":"1201_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1057\/jors.1974.5","volume":"25","author":"RG Dyson","year":"1974","unstructured":"Dyson RG, Gregory AS (1974) The cutting stock problem in the flat glass industry. J Oper Res Soc 25:41\u201353. https:\/\/doi.org\/10.1057\/jors.1974.5","journal-title":"J Oper Res Soc"},{"key":"1201_CR14","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0377-2217(97)00257-9","volume":"110","author":"H Foerster","year":"1998","unstructured":"Foerster H, W\u00e4scher G (1998) Simulated annealing for order spread minimization in sequencing cutting patterns. Eur J Oper Res 110:272\u2013281. https:\/\/doi.org\/10.1016\/S0377-2217(97)00257-9","journal-title":"Eur J Oper Res"},{"key":"1201_CR15","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co, USA"},{"key":"1201_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1965","unstructured":"Gilmore PC, Gomory RE (1965) Multistage cutting stock problems of two and more dimensions. Oper Res 13:94\u2013120. https:\/\/doi.org\/10.1287\/opre.13.1.94","journal-title":"Oper Res"},{"key":"1201_CR17","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2020.06.050","volume":"289","author":"M Iori","year":"2021","unstructured":"Iori M, De Lima VL, Martello S, Miyazawa FK, Monaci M (2021) Exact solution techniques for two-dimensional cutting and packing. Eur J Oper Res 289:399\u2013415. https:\/\/doi.org\/10.1016\/j.ejor.2020.06.050","journal-title":"Eur J Oper Res"},{"key":"1201_CR18","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1016\/S0305-0548(01)00054-5","volume":"29","author":"A Linhares","year":"2002","unstructured":"Linhares A, Yanasse HH (2002) Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Comput Oper Res 29:1759\u20131772. https:\/\/doi.org\/10.1016\/S0305-0548(01)00054-5","journal-title":"Comput Oper Res"},{"key":"1201_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S, Monaci M (2002) Two-dimensional packing problems: a survey. Eur J Oper Res 141:241\u2013252. https:\/\/doi.org\/10.1016\/S0377-2217(02)00123-6","journal-title":"Eur J Oper Res"},{"key":"1201_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi A, Martello S, Vigo D (1999) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J Comput 11:345\u2013357. https:\/\/doi.org\/10.1287\/ijoc.11.4.345","journal-title":"INFORMS J Comput"},{"key":"1201_CR21","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi A, Martello S, Vigo D (2002) Recent advances on two-dimensional bin packing problems. Discret Appl Math 123:379\u2013396. https:\/\/doi.org\/10.1016\/S0166-218X(01)00347-X","journal-title":"Discret Appl Math"},{"key":"1201_CR22","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A Lodi","year":"2004","unstructured":"Lodi A, Martello S, Vigo D (2004) Models and bounds for two-dimensional level packing problems. J Comb Optim 8:363\u2013379. https:\/\/doi.org\/10.1023\/B:JOCO.0000038915.62826.79","journal-title":"J Comb Optim"},{"key":"1201_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1590\/0101-7438.2015.035.02.0213","volume":"35","author":"IC Lopes","year":"2015","unstructured":"Lopes IC, De Carvalho JM (2015) Graph properties of minimization of open stacks problems and a new integer programming model. Pesquisa Operacional 35:213\u2013250. https:\/\/doi.org\/10.1590\/0101-7438.2015.035.02.0213","journal-title":"Pesquisa Operacional"},{"key":"1201_CR24","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1016\/j.cor.2009.08.005","volume":"37","author":"R Macedo","year":"2010","unstructured":"Macedo R, Alves C, Val\u00e9rio de Carvalho JM (2010) Arc-flow model for the two-dimensional guillotine cutting stock problem. Comput Oper Res 37:991\u20131001. https:\/\/doi.org\/10.1016\/j.cor.2009.08.005","journal-title":"Comput Oper Res"},{"key":"1201_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF01588227","volume":"17","author":"OBG Madsen","year":"1979","unstructured":"Madsen OBG (1979) Glass cutting in a small firm. Math Program 17:85\u201390. https:\/\/doi.org\/10.1007\/BF01588227","journal-title":"Math Program"},{"key":"1201_CR26","doi-asserted-by":"publisher","unstructured":"Madsen OBG (1983). Production planning in a small firm in the industry glass. In Wilson B, Berg CC, & French D (Eds.), Efficiency of manufacturing systems (pp. 245\u2013253). Boston, MA: Springer US. https:\/\/doi.org\/10.1007\/978-1-4684-4475-9","DOI":"10.1007\/978-1-4684-4475-9"},{"key":"1201_CR27","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1057\/jors.1988.42","volume":"39","author":"OBG Madsen","year":"1988","unstructured":"Madsen OBG (1988) An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry. J Oper Res Soc 39:249\u2013256. https:\/\/doi.org\/10.1057\/jors.1988.42","journal-title":"J Oper Res Soc"},{"key":"1201_CR28","doi-asserted-by":"publisher","unstructured":"Martin M, Yanasse HH, Pinto MJ (2021) Mathematical models for the minimization of open stacks problem. International transactions in operational research, n\/a. https:\/\/doi.org\/10.1111\/itor.13053","DOI":"10.1111\/itor.13053"},{"key":"1201_CR29","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2022.2070882","author":"M Martin","year":"2022","unstructured":"Martin M, Yanasse HH, Santos MO, Morabito R (2022) Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2022.2070882","journal-title":"Int J Prod Res"},{"key":"1201_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-022-09464-9","author":"GM Melega","year":"2022","unstructured":"Melega GM, De Araujo SA, Jans R, Morabito R (2022) Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups. Flex Serv Manuf J. https:\/\/doi.org\/10.1007\/s10696-022-09464-9","journal-title":"Flex Serv Manuf J"},{"key":"1201_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s001860000066","volume":"52","author":"M Padberg","year":"2000","unstructured":"Padberg M (2000) Packing small boxes into a big box. Math Methods Oper Res 52:1\u201321. https:\/\/doi.org\/10.1007\/s001860000066","journal-title":"Math Methods Oper Res"},{"key":"1201_CR32","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0377-2217(02)00715-4","volume":"153","author":"E Pi\u00f1ana","year":"2004","unstructured":"Pi\u00f1ana E, Plana I, Campos V, Mart\u00ed R (2004) Grasp and path relinking for the matrix bandwidth minimization. Eur J Oper Res 153:200\u2013210. https:\/\/doi.org\/10.1016\/S0377-2217(02)00715-4","journal-title":"Eur J Oper Res"},{"key":"1201_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102311","volume":"102","author":"S Polyakovskiy","year":"2021","unstructured":"Polyakovskiy S, M\u2019Hallah R (2021) Just-in-time two-dimensional bin packing. Omega 102:102311. https:\/\/doi.org\/10.1016\/j.omega.2020.102311","journal-title":"Omega"},{"key":"1201_CR34","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.ejor.2005.11.064","volume":"183","author":"J Puchinger","year":"2007","unstructured":"Puchinger J, Raidl GR (2007) Models and algorithms for three-stage two-dimensional bin packing. Eur J Oper Res 183:1304\u20131327. https:\/\/doi.org\/10.1016\/j.ejor.2005.11.064","journal-title":"Eur J Oper Res"},{"key":"1201_CR35","doi-asserted-by":"publisher","unstructured":"Scheithauer G (2018). Introduction to cutting and packing optimization: problems, modeling approaches, solution methods. International series in operations research and management science. Springer. https:\/\/doi.org\/10.1007\/978-3-319-64143-0","DOI":"10.1007\/978-3-319-64143-0"},{"key":"1201_CR36","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.ejor.2010.01.039","volume":"205","author":"E Silva","year":"2010","unstructured":"Silva E, Alvelos F, Val\u00e9rio de Carvalho JM (2010) An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur J Oper Res 205:699\u2013708. https:\/\/doi.org\/10.1016\/j.ejor.2010.01.039","journal-title":"Eur J Oper Res"},{"key":"1201_CR37","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109\u20131130. https:\/\/doi.org\/10.1016\/j.ejor.2005.12.047","journal-title":"Eur J Oper Res"},{"key":"1201_CR38","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1016\/j.ejor.2005.09.054","volume":"183","author":"HH Yanasse","year":"2007","unstructured":"Yanasse HH, Lamosa MJP (2007) An integrated cutting stock and sequencing problem. Eur J Oper Res 183:1353\u20131370. https:\/\/doi.org\/10.1016\/j.ejor.2005.09.054","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01201-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01201-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01201-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T19:10:48Z","timestamp":1724440248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01201-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["1201"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01201-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"27 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"8"}}