{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T15:42:26Z","timestamp":1766504546536,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2018\/16600-0","2016\/01860-1"],"award-info":[{"award-number":["2018\/16600-0","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":["421130\/2018-0","306558\/2018-1"],"award-info":[{"award-number":["421130\/2018-0","306558\/2018-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","award":["POCI-01-0145-FEDER-029609"],"award-info":[{"award-number":["POCI-01-0145-FEDER-029609"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2019\/25041-8","2018\/07240-0"],"award-info":[{"award-number":["2019\/25041-8","2018\/07240-0"]}],"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":["317460\/2021-8"],"award-info":[{"award-number":["317460\/2021-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s12351-022-00735-9","type":"journal-article","created":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T16:02:45Z","timestamp":1659801765000},"page":"5363-5403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9278-505X","authenticated-orcid":false,"given":"Douglas Nogueira","family":"do Nascimento","sequence":"first","affiliation":[]},{"given":"Adriana Cristina","family":"Cherri","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Fernando","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,6]]},"reference":[{"issue":"11","key":"735_CR1","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1057\/jors.2013.108","volume":"65","author":"R Andrade","year":"2014","unstructured":"Andrade R, Birgin EG, Morabito R, Ronconi DP (2014) MIP models for two-dimensional non-guillotine cutting problems with usable leftovers. J Oper Res Soc 65(11):1649\u20131663. https:\/\/doi.org\/10.1057\/jors.2013.108","journal-title":"J Oper Res Soc"},{"key":"735_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1111\/itor.12077","volume":"23","author":"R Andrade","year":"2016","unstructured":"Andrade R, Birgin EG, Morabito R (2016) Two-stage two-dimensional guillotine cutting stock problems with usable leftover. Int Trans Oper Res 23:121\u2013145. https:\/\/doi.org\/10.1111\/itor.12077","journal-title":"Int Trans Oper Res"},{"key":"735_CR3","doi-asserted-by":"publisher","unstructured":"Arenales MN, Cherri AC, do Nascimento DN, Vianna ACG (2015) A new mathematical model for the cutting stock\/leftover problem. Pesqui Oper 35(3):509\u2013522. https:\/\/doi.org\/10.1590\/0101-7438.2015.035.03.0509","DOI":"10.1590\/0101-7438.2015.035.03.0509"},{"issue":"3","key":"735_CR4","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1111\/itor.12648","volume":"27","author":"EG Birgin","year":"2020","unstructured":"Birgin EG, Rom\u00e3o OC, Ronconi DP (2020) The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. Int Trans Oper Res 27(3):1392\u20131418. https:\/\/doi.org\/10.1111\/itor.12648","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"735_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.24425\/119524","volume":"9","author":"A Bouaine","year":"2018","unstructured":"Bouaine A, Lebbar M, Ha MA (2018) Minimization of the wood wastes for an industry of furnishing: a two dimensional cutting stock problem. Manag Prod Eng Rev 9(2):42\u201351. https:\/\/doi.org\/10.24425\/119524","journal-title":"Manag Prod Eng Rev"},{"key":"735_CR6","unstructured":"Cherri AC (2009) Algumas extens\u00f5es do problema de corte de estoque com sobras de material aproveit\u00e1veis. Doctoral thesis, ICMC-USP, S\u00e3o Carlos"},{"issue":"2","key":"735_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2013.11.026","volume":"236","author":"AC Cherri","year":"2014","unstructured":"Cherri AC, Arenales MN, Yanasse HH, Poldi KC, Vianna ACG (2014) The one-dimensional cutting stock problem with usable leftovers\u2014a survey. Eur J Oper Res 236(2):395\u2013402","journal-title":"Eur J Oper Res"},{"issue":"1","key":"735_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0377-2217(93)E0277-5","volume":"83","author":"N Christofides","year":"1995","unstructured":"Christofides N, Hadjiconstantinou E (1995) An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Eur J Oper Res 83(1):21\u201338. https:\/\/doi.org\/10.1016\/0377-2217(93)E0277-5","journal-title":"Eur J Oper Res"},{"key":"735_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","volume":"191","author":"GF Cintra","year":"2008","unstructured":"Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC (2008) Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur J Oper Res 191:61\u201385. https:\/\/doi.org\/10.1016\/j.ejor.2007.08.007","journal-title":"Eur J Oper Res"},{"key":"735_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s13675-019-00113-9","volume":"7","author":"F Clautiaux","year":"2019","unstructured":"Clautiaux F, Sadykov R, Vanderbeck F, Viaud Q (2019) Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. EURO J Comput Optim 7:265\u2013297. https:\/\/doi.org\/10.1007\/s13675-019-00113-9","journal-title":"EURO J Comput Optim"},{"key":"735_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.jclepro.2017.08.153","volume":"167","author":"KR Coelho","year":"2017","unstructured":"Coelho KR, Cherri AC, Baptista EC, Jabbour CJC, Soler EM (2017) Sustainable operations: The cutting stock problem with usable leftovers from a sustainable perspective. J Clean Prod 167:545\u2013552. https:\/\/doi.org\/10.1016\/j.jclepro.2017.08.153","journal-title":"J Clean Prod"},{"key":"735_CR12","doi-asserted-by":"publisher","unstructured":"do Nascimento DN, de Ara\u00fajo SA, Cherri AC (2020) Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-020-03772-9","DOI":"10.1007\/s10479-020-03772-9"},{"key":"735_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.endm.2014.11.018","volume":"47","author":"F Dusberger","year":"2015","unstructured":"Dusberger F, Raidl GR (2015) Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search. Electron Notes Discrete Math 47:133\u2013140. https:\/\/doi.org\/10.1016\/j.endm.2014.11.018","journal-title":"Electron Notes Discrete Math"},{"issue":"8","key":"735_CR14","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1016\/j.cor.2013.02.026","volume":"40","author":"F Furini","year":"2013","unstructured":"Furini F, Malaguti E (2013) Models for the two-dimensional two-stage cutting stock problem with multiple stock size. Comput Oper Res 40(8):1953\u20131962. https:\/\/doi.org\/10.1016\/j.cor.2013.02.026","journal-title":"Comput Oper Res"},{"issue":"1","key":"735_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.ejor.2011.10.018","volume":"218","author":"F Furini","year":"2012","unstructured":"Furini F, Malaguti E, Dur\u00e1n RM, Persiani A, Toth P (2012) A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. Eur J Oper Res 218(1):251\u2013260. https:\/\/doi.org\/10.1016\/j.ejor.2011.10.018","journal-title":"Eur J Oper Res"},{"key":"735_CR16","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1287\/ijoc.2016.0710","volume":"28","author":"F Furini","year":"2016","unstructured":"Furini F, Malaguti E, Thomopulos D (2016) Modeling two-dimensional guillotine cutting problems via integer programming. INFORMS J Comput 28:736\u2013751. https:\/\/doi.org\/10.1287\/ijoc.2016.0710","journal-title":"INFORMS J Comput"},{"issue":"6","key":"735_CR17","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper Res 9(6):849\u2013859. https:\/\/doi.org\/10.1287\/opre.9.6.849","journal-title":"Oper Res"},{"issue":"6","key":"735_CR18","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting-stock problem\u2014part II. Oper Res 11(6):863\u2013888. https:\/\/doi.org\/10.1287\/opre.11.6.863","journal-title":"Oper Res"},{"issue":"1","key":"735_CR19","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(1):94\u2013120. https:\/\/doi.org\/10.1287\/opre.13.1.94","journal-title":"Oper Res"},{"key":"735_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.cor.2019.05.005","volume":"109","author":"SJ Kwon","year":"2019","unstructured":"Kwon SJ, Joung S, Lee K (2019) Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem. Comput Oper Res 109:159\u2013169. https:\/\/doi.org\/10.1016\/j.cor.2019.05.005","journal-title":"Comput Oper Res"},{"issue":"2","key":"735_CR21","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1108\/EC-11-2020-0660","volume":"39","author":"F Li","year":"2022","unstructured":"Li F, Chen Y, Hu X (2022) Manufacturing-oriented silicon steel coil lengthwise cutting stock problem with useable leftover. Eng Comput (Swansea) 39(2):477\u2013492. https:\/\/doi.org\/10.1108\/EC-11-2020-0660","journal-title":"Eng Comput (Swansea)"},{"key":"735_CR22","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s12351-015-0221-x","volume":"17","author":"L Liu","year":"2017","unstructured":"Liu L, Liu X, Pei J, Fan W, Pardalos PM (2017) A study on decision making of cutting stock with frustum of cone bars. Oper Res Int J 17:187\u2013204. https:\/\/doi.org\/10.1007\/s12351-015-0221-x","journal-title":"Oper Res Int J"},{"issue":"2","key":"735_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10107-002-0319-9","volume":"94","author":"A Lodi","year":"2003","unstructured":"Lodi A, Monaci M (2003) Integer linear programming models for 2-staged two-dimensional Knapsack problems. Math Program 94(2):257\u2013278. https:\/\/doi.org\/10.1007\/s10107-002-0319-9","journal-title":"Math Program"},{"issue":"9","key":"735_CR24","doi-asserted-by":"publisher","first-page":"2712","DOI":"10.1080\/00207543.2019.1630773","volume":"58","author":"M Martin","year":"2020","unstructured":"Martin M, Hokama PH, Morabito R, Munari P (2020) The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm. Int J Prod Res 58(9):2712\u20132729. https:\/\/doi.org\/10.1080\/00207543.2019.1630773","journal-title":"Int J Prod Res"},{"key":"735_CR25","unstructured":"Morabito R (1989) Corte de estoque bidimensional. Dissertation, ICMC\u2013USP, S\u00e3o Carlos"},{"issue":"3","key":"735_CR26","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, de Carvalho JV (2010) An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur J Oper Res 205(3):699\u2013708. https:\/\/doi.org\/10.1016\/j.ejor.2010.01.039","journal-title":"Eur J Oper Res"},{"issue":"1","key":"735_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ijpe.2004.12.017","volume":"99","author":"S Suliman","year":"2006","unstructured":"Suliman S (2006) A sequential heuristic procedure for the two-dimensional cutting-stock problem. Int J Prod Econ 99(1):177\u2013185. https:\/\/doi.org\/10.1016\/j.ijpe.2004.12.017","journal-title":"Int J Prod Econ"},{"issue":"2","key":"735_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1504\/IJLSM.2020.104781","volume":"35","author":"S Sumetthapiwat","year":"2020","unstructured":"Sumetthapiwat S, Intiyot B, Jeenanunta C (2020) A column generation on two-dimensional cutting stock problem with fixed-size usable leftover and multiple stock sizes. Int J Logist Syst Manag 35(2):273\u2013288. https:\/\/doi.org\/10.1504\/IJLSM.2020.104781","journal-title":"Int J Logist Syst Manag"},{"issue":"2","key":"735_CR29","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10100-017-0466-y","volume":"25","author":"L Tomat","year":"2017","unstructured":"Tomat L, Gradisar M (2017) One-dimensional stock cutting: optimization of usable leftovers in consecutive orders. Cent Eur J Oper Res 25(2):473\u2013489. https:\/\/doi.org\/10.1007\/s10100-017-0466-y","journal-title":"Cent Eur J Oper Res"},{"key":"735_CR30","doi-asserted-by":"crossref","unstructured":"Wang PY (1983) Two algorithms for constrained two-dimensional cutting stock problems. INFORMS Oper Res 31(3):573\u2014586. https:\/\/www.jstor.org\/stable\/170624","DOI":"10.1287\/opre.31.3.573"},{"issue":"2","key":"735_CR31","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.ejor.2020.03.060","volume":"286","author":"D Wang","year":"2020","unstructured":"Wang D, Xiao F, Zhou L, Liang Z (2020) Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation. Eur J Oper Res 286(2):547\u2013563. https:\/\/doi.org\/10.1016\/j.ejor.2020.03.060","journal-title":"Eur J Oper Res"},{"issue":"1","key":"735_CR32","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.ejor.2017.07.036","volume":"265","author":"DA Wuttke","year":"2018","unstructured":"Wuttke DA, Heese HS (2018) Two-dimensional cutting stock problem with sequence dependent setup times. Eur J Oper Res 265(1):303\u2013315. https:\/\/doi.org\/10.1016\/j.ejor.2017.07.036","journal-title":"Eur J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-022-00735-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-022-00735-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-022-00735-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T14:21:29Z","timestamp":1666362089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-022-00735-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,6]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["735"],"URL":"https:\/\/doi.org\/10.1007\/s12351-022-00735-9","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2022,8,6]]},"assertion":[{"value":"14 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}