{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:32:37Z","timestamp":1771979557142,"version":"3.50.1"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100022823","name":"Centro Federal de Educa\u00e7\u00e3o Tecnol\u00f3gica de Minas Gerais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100022823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10732-025-09547-4","type":"journal-article","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T17:12:45Z","timestamp":1738689165000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs"],"prefix":"10.1007","volume":"31","author":[{"given":"Elisama","family":"de Ara\u00fajo Silva Oliveira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Wanner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisangela Martins","family":"de S\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7831-6740","authenticated-orcid":false,"given":"S\u00e9rgio Ricardo","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,4]]},"reference":[{"issue":"2","key":"9547_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times\/costs. Eur. J. Oper. Res. 246(2), 345\u2013378 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2015.04.004","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9547_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219\u2013239 (1999). https:\/\/doi.org\/10.1016\/S0305-0483(98)00042-5","journal-title":"Omega"},{"issue":"3","key":"9547_CR3","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C.T., Cheng, T.C.E., et al.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2006.06.060","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9547_CR4","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.M.: Reactive GRASP for the strip-packing problem. Comput. Oper. Res. 35(4), 1065\u20131083 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9547_CR5","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1016\/j.cor.2006.08.014","volume":"35","author":"C Alves","year":"2008","unstructured":"Alves, C., Val\u00e9rio de Carvalho, J.: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput. Oper. Res. 35(4), 1315\u20131328 (2008). https:\/\/doi.org\/10.1016\/j.cor.2006.08.014","journal-title":"Comput. Oper. Res."},{"key":"9547_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.omega.2014.01.004","volume":"46","author":"C Arbib","year":"2014","unstructured":"Arbib, C., Marinelli, F.: On cutting stock with due dates. Omega 46, 11\u201320 (2014)","journal-title":"Omega"},{"key":"9547_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.omega.2016.06.003","volume":"68","author":"C Arbib","year":"2017","unstructured":"Arbib, C., Marinelli, F.: Maximum lateness minimization in one-dimensional bin packing. Omega 68, 76\u201384 (2017)","journal-title":"Omega"},{"issue":"2","key":"9547_CR8","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/S0377-2217(02)00125-X","volume":"141","author":"G Belov","year":"2002","unstructured":"Belov, G., Scheithauer, G.: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. 141(2), 274\u2013294 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9547_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"9547_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-04918-7_13","volume-title":"Hybrid Metaheuristics: Proceedings of the 6th International Workshop (HM 2009), Udine, Italy, October 16\u201317, 2009","author":"MA Boschetti","year":"2009","unstructured":"Boschetti, M.A., Maniezzo, V., Roffilli, M., et al.: Matheuristics: optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., et al. (eds.) Hybrid Metaheuristics: Proceedings of the 6th International Workshop (HM 2009), Udine, Italy, October 16\u201317, 2009, vol. 5818, pp. 171\u2013177. Springer, Berlin (2009)"},{"issue":"6","key":"9547_CR11","doi-asserted-by":"publisher","first-page":"2840","DOI":"10.1111\/itor.13301","volume":"30","author":"MA Boschetti","year":"2023","unstructured":"Boschetti, M.A., Letchford, A.N., Maniezzo, V.: Matheuristics: survey and synthesisy. Int. Trans. Oper. Res. 30(6), 2840\u20132866 (2023)","journal-title":"Int. Trans. Oper. Res."},{"key":"9547_CR12","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-319-21407-8_35","volume-title":"Computational Science and Its Applications - ICCSA 2015","author":"N Braga","year":"2015","unstructured":"Braga, N., Alves, C., Macedo, R., et al.: A model-based heuristic for the combined cutting stock and scheduling problem. In: Gervasi, O., Murgante, B., Misra, S., et al. (eds.) Computational Science and Its Applications - ICCSA 2015, vol. 9156, pp. 490\u2013505. Springer, Cham (2015)"},{"key":"9547_CR13","first-page":"131","volume-title":"Exact Solution of Combined Cutting Stock and Scheduling Problems","author":"N Braga","year":"2016","unstructured":"Braga, N., Alves, C., Val\u00e9riode Carvalho, J.M.: Exact Solution of Combined Cutting Stock and Scheduling Problems, vol. 682, pp. 131\u2013139. Springer, Cham (2016)"},{"issue":"3","key":"9547_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1504\/IJICA.2016.078724","volume":"7","author":"N Braga","year":"2016","unstructured":"Braga, N., Alves, C., Macedo, R., et al.: Combined cutting stock and scheduling: a matheuristic approach. Int. J. Innovative Comput. Appl. 7(3), 135\u2013146 (2016)","journal-title":"Int. J. Innovative Comput. Appl."},{"issue":"3","key":"9547_CR15","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.ejor.2008.04.039","volume":"196","author":"AC Cherri","year":"2009","unstructured":"Cherri, A.C., Arenales, M.N., Yanasse, H.H.: The one-dimensional cutting stock problem with usable leftover-a heuristic approach. Eur. J. Oper. Res. 196(3), 897\u2013908 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9547_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2013.11.026","volume":"236","author":"AC Cherri","year":"2014","unstructured":"Cherri, A.C., Arenales, M.N., Yanasse, H.H., et al.: The one-dimensional cutting stock problem with usable leftovers-a survey. Eur. J. Oper. Res. 236(2), 395\u2013402 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9547_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.ejor.2009.10.028","volume":"204","author":"Y Cui","year":"2010","unstructured":"Cui, Y., Yang, Y.: A heuristic for the one-dimensional cutting stock problem with usable leftover. Eur. J. Oper. Res. 204(2), 245\u2013250 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9547_CR18","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2014.12.015","volume":"243","author":"Y Cui","year":"2015","unstructured":"Cui, Y., Zhong, C., Yao, Y.: Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost. Eur. J. Oper. Res. 243(2), 540\u2013546 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.12.015","journal-title":"Eur. J. Oper. Res."},{"key":"9547_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cor.2018.12.012","volume":"104","author":"JO Cunha","year":"2019","unstructured":"Cunha, J.O., Kramer, H.H., Melo, R.A.: Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing. Comput. Oper. Res. 104, 149\u2013158 (2019). https:\/\/doi.org\/10.1016\/j.cor.2018.12.012","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9547_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1590\/0101-7438.2014.034.02.0165","volume":"34","author":"SA de Araujo","year":"2014","unstructured":"de Araujo, S.A., Poldi, K.C., Smith, J.: A genetic algorithm for the one-dimensional cutting stock problem with setups. Pesquisa Operacional 34(2), 165\u2013187 (2014)","journal-title":"Pesquisa Operacional"},{"issue":"1","key":"9547_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/ijoc.2018.0880","volume":"32","author":"M Delorme","year":"2020","unstructured":"Delorme, M., Iori, M.: Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. INFORMS J. Comput. 32(1), 101\u2013119 (2020)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"9547_CR22","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.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1), 1\u201320 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9547_CR23","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1287\/opre.29.6.1092","volume":"29","author":"H Dyckhoff","year":"1981","unstructured":"Dyckhoff, H.: A new linear programming approach to the cutting stock problem. Oper. Res. 29(6), 1092\u20131104 (1981)","journal-title":"Oper. Res."},{"issue":"2","key":"9547_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2), 145\u2013159 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9547_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1057\/jors.1988.6","volume":"39","author":"AA Farley","year":"1988","unstructured":"Farley, A.A.: Mathematical programming models for cutting-stock problems in the clothing industry. J. Oper. Res. Soc. 39(1), 41\u201353 (1988)","journal-title":"J. Oper. Res. Soc."},{"issue":"107","key":"9547_CR26","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.cie.2021.107592","volume":"162","author":"GA Fernandes","year":"2021","unstructured":"Fernandes, G.A., de Souza, S.R.: A matheuristic approach to the multi-mode resource constrained project scheduling problem. Comput. Ind. Eng. 162(107), 592 (2021). https:\/\/doi.org\/10.1016\/j.cie.2021.107592","journal-title":"Comput. Ind. Eng."},{"issue":"1\u20133","key":"9547_CR27","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Program."},{"issue":"7","key":"9547_CR28","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1080\/002075400188780","volume":"38","author":"H Foerster","year":"2000","unstructured":"Foerster, H., Wascher, G.: Pattern reduction in one-dimensional cutting stock problems. Int. J. Prod. Res. 38(7), 1657\u20131676 (2000)","journal-title":"Int. J. Prod. Res."},{"key":"9547_CR29","unstructured":"Garey, M.R., Johnson, D.S.: A guide to the theory of NP-completeness. In: Computers and Intractability, pp. 641\u2013650 (1979)"},{"issue":"3","key":"9547_CR30","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T Gau","year":"1995","unstructured":"Gau, T., W\u00e4scher, G.: CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. Eur. J. Oper. Res. 84(3), 572\u2013579 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9547_CR31","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Oper. Res. 9(6), 849\u2013859 (1961)","journal-title":"Oper. Res."},{"issue":"6","key":"9547_CR32","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem - Part II. Oper. Res. 11(6), 863\u2013888 (1963)","journal-title":"Oper. Res."},{"issue":"1","key":"9547_CR33","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1965","unstructured":"Gilmore, P.C., Gomory, R.E.: Multistage cutting stock problems of two and more dimensions. Oper. Res. 13(1), 94\u2013120 (1965)","journal-title":"Oper. Res."},{"issue":"3","key":"9547_CR34","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/opre.23.3.483","volume":"23","author":"RW Haessler","year":"1975","unstructured":"Haessler, R.W.: Controlling cutting pattern changes in one-dimensional trim problems. Oper. Res. 23(3), 483\u2013493 (1975)","journal-title":"Oper. Res."},{"key":"9547_CR35","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/mnsc.29.2.200","volume":"29","author":"R Haessler","year":"1983","unstructured":"Haessler, R., Talbot, F.B.: A 0\u20131 model for solving the corrugator trim problem. Manage. Sci. 29, 200\u2013209 (1983)","journal-title":"Manage. Sci."},{"key":"9547_CR36","unstructured":"Harjunkoski, I.: Application of MINLP Methods on a Scheduling Problem in the Paper Converting Industry. PhD Dissertation, Abo Akademi University, Abo, Finland (1997)"},{"key":"9547_CR37","doi-asserted-by":"publisher","first-page":"S121","DOI":"10.1016\/0098-1354(96)00031-2","volume":"20","author":"I Harjunkoski","year":"1996","unstructured":"Harjunkoski, I., Westerlund, T., Isaksson, J., et al.: Different formulations for solving trim loss problems in a paper-converting mill with ILP. Comput. Chem. Eng. 20, S121\u2013S126 (1996)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"9547_CR38","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/S0377-2217(97)00066-0","volume":"105","author":"I Harjunkoski","year":"1998","unstructured":"Harjunkoski, I., Westerlund, T., P\u00f6rn, R., et al.: Different transformations for solving non-convex trim-loss problems by MINLP. Eur. J. Oper. Res. 105(3), 594\u2013603 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9547_CR39","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1016\/S0098-1354(99)00310-5","volume":"23","author":"I Harjunkoski","year":"1999","unstructured":"Harjunkoski, I., Westerlund, T., P\u00f6rn, R.: Numerical and environmental considerations on a complex industrial mixed integer non-linear programming (MINLP) problem. Comput. Chem. Eng. 23, 1545\u20131561 (1999)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"9547_CR40","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1057\/jors.1996.4","volume":"47","author":"LC Hendry","year":"1996","unstructured":"Hendry, L.C., Fok, K.K., Shek, K.W.: A cutting stock and scheduling problem in the copper industry. Journal of the Operational Research Society 47(1), 38\u201347 (1996)","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"9547_CR41","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1590\/S0101-74382013000200001","volume":"33","author":"S Henn","year":"2013","unstructured":"Henn, S., W\u00e4scher, G.: Extensions of cutting problems: setups. Pesquisa Operacional 33(2), 133\u2013162 (2013). https:\/\/doi.org\/10.1590\/S0101-74382013000200001","journal-title":"Pesquisa Operacional"},{"key":"9547_CR42","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10732-018-9392-y","volume":"25","author":"F Hernandez","year":"2019","unstructured":"Hernandez, F., Gendreau, M., Jabali, O., et al.: A local branching matheuristic for the multi-vehicle routing problem with stochastic demands. J. Heuristics 25, 215\u2013245 (2019)","journal-title":"J. Heuristics"},{"issue":"1","key":"9547_CR43","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1186\/2251-712X-8-24","volume":"8","author":"MH Jahromi","year":"2012","unstructured":"Jahromi, M.H., Tavakkoli-Moghaddam, R., Makui, A., et al.: Solving an one-dimensional cutting stock problem by simulated annealing and tabu search. J. Ind. Eng. Int. 8(1), 8 (2012). https:\/\/doi.org\/10.1186\/2251-712X-8-24","journal-title":"J. Ind. Eng. Int."},{"issue":"1","key":"9547_CR44","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/S0377-2217(02)00704-X","volume":"153","author":"RE Johnston","year":"2004","unstructured":"Johnston, R.E., Sadinlija, E.: A new model for complete solutions to one-dimensional cutting stock problems, timetabling and rostering. Eur. J. Oper. Res. 153(1), 176\u2013183 (2004). https:\/\/doi.org\/10.1016\/S0377-2217(02)00704-X","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9547_CR45","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"LV Kantorovich","year":"1960","unstructured":"Kantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6(4), 366\u2013422 (1960)","journal-title":"Manag. Sci."},{"issue":"1","key":"9547_CR46","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0360-8352(96)00205-7","volume":"32","author":"K Lai","year":"1997","unstructured":"Lai, K., Chan, J.W.: Developing a simulated annealing algorithm for the cutting stock problem. Comput. Ind. Eng. 32(1), 115\u2013127 (1997)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"9547_CR47","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1057\/jors.1996.56","volume":"47","author":"S Li","year":"1996","unstructured":"Li, S.: Multi-job cutting stock problem with due dates and release dates. J. Oper. Res. Soc. 47(4), 490\u2013510 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"9547_CR48","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1nez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1nez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., et al.: The Irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"9547_CR49","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.cor.2018.02.016","volume":"95","author":"N Ma","year":"2018","unstructured":"Ma, N., Liu, Y., Zhou, Z., et al.: Combined cutting stock and lot-sizing problem with pattern setup. Comput. Oper. Res. 95, 44\u201355 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.02.016","journal-title":"Comput. Oper. Res."},{"key":"9547_CR50","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.cor.2019.05.013","volume":"109","author":"N Ma","year":"2019","unstructured":"Ma, N., Liu, Y., Zhou, Z.: Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost. Computers & Operations Research 109, 218\u2013229 (2019). https:\/\/doi.org\/10.1016\/j.cor.2019.05.013","journal-title":"Computers & Operations Research"},{"key":"9547_CR51","doi-asserted-by":"crossref","unstructured":"Martin, M., Yanasse, H.H., Salles-Neto, L.L.: Pattern-based ilp models for the one-dimensional cutting stock problem with setup cost. J. Combin. Optim. 1\u201326 (2022)","DOI":"10.1007\/s10878-022-00848-z"},{"issue":"e20170","key":"9547_CR52","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1590\/0103-6513.20170105","volume":"28","author":"M Martin","year":"2018","unstructured":"Martin, M., Moretti, A., Gomes-Ruggiero, M., et al.: Modification of Haessler\u2019s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost. Production 28(e20170), 105 (2018). https:\/\/doi.org\/10.1590\/0103-6513.20170105","journal-title":"Production"},{"issue":"2","key":"9547_CR53","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ejor.2017.10.008","volume":"266","author":"J Martinovic","year":"2018","unstructured":"Martinovic, J., Scheithauer, G., Val\u00e9rio de Carvalho, J.M.: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. Eur. J. Oper. Res. 266(2), 458\u2013471 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"9547_CR54","doi-asserted-by":"crossref","unstructured":"Melega, G.M., de\u00a0Araujo, S.A., Jans, R. et\u00a0al.: Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups. Flex. Serv. Manufact. J. 1\u201337 (2022)","DOI":"10.1007\/s10696-022-09464-9"},{"issue":"2","key":"9547_CR55","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s10479-020-03764-9","volume":"295","author":"GM Melega","year":"2020","unstructured":"Melega, G.M., de Araujo, S.A., Morabito, R.: Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems. Ann. Oper. Res. 295(2), 695\u2013736 (2020)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9547_CR56","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.cor.2012.06.007","volume":"40","author":"A Mobasher","year":"2013","unstructured":"Mobasher, A., Ekici, A.: Solution approaches for the cutting stock problem with setup cost. Comput. Oper. Res. 40(1), 225\u2013235 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.06.007","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"9547_CR57","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1080\/002075400411457","volume":"38","author":"R Morabito","year":"2000","unstructured":"Morabito, R., Arenales, M.: Optimizing the cutting of stock plates in a furniture company. Int. J. Prod. Res. 38(12), 2725\u20132742 (2000)","journal-title":"Int. J. Prod. Res."},{"issue":"111","key":"9547_CR58","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.asoc.2024.111947","volume":"164","author":"CM Ngoo","year":"2024","unstructured":"Ngoo, C.M., Goh, S.L., Sze, S.N., et al.: A survey of mat-heuristics for combinatorial optimisation problems: variants, trends and opportunities. Appl. Soft Comput. 164(111), 947 (2024). https:\/\/doi.org\/10.1016\/j.asoc.2024.111947","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"9547_CR59","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1016\/j.ejor.2021.03.049","volume":"295","author":"WA Oliveira","year":"2021","unstructured":"Oliveira, W.A., Fiorotto, D.J., Song, X., et al.: An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem. Eur. J. Oper. Res. 295(3), 996\u20131007 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2021.03.049","journal-title":"Eur. J. Oper. Res."},{"issue":"spe","key":"9547_CR60","doi-asserted-by":"publisher","DOI":"10.1590\/0101-7438.2021.041s1.00235094","volume":"41","author":"LM Pierini","year":"2021","unstructured":"Pierini, L.M., Poldi, K.C.: Lot sizing and cutting stock problems in a paper production process. Pesquisa Operacional 41(spe), e235094 (2021). https:\/\/doi.org\/10.1590\/0101-7438.2021.041s1.00235094","journal-title":"Pesquisa Operacional"},{"issue":"1\u20132","key":"9547_CR61","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10479-015-2103-2","volume":"238","author":"KC Poldi","year":"2016","unstructured":"Poldi, K.C., de Araujo, S.A.: Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem. Ann. Oper. Res. 238(1\u20132), 497\u2013520 (2016)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9547_CR62","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1590\/S0101-74382006000300003","volume":"26","author":"KC Poldi","year":"2006","unstructured":"Poldi, K.C., Arenales, M.N.: Heur\u00edsticas para o problema de corte de estoque unidimensional inteiro. Pesquisa Operacional 26(3), 473\u2013492 (2006)","journal-title":"Pesquisa Operacional"},{"issue":"6","key":"9547_CR63","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1016\/j.cor.2008.07.001","volume":"36","author":"KC Poldi","year":"2009","unstructured":"Poldi, K.C., Arenales, M.N.: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Computers & Operations Research 36(6), 2074\u20132081 (2009)","journal-title":"Computers & Operations Research"},{"key":"9547_CR64","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1590\/S0101-74382010000100008","volume":"30","author":"KC Poldi","year":"2010","unstructured":"Poldi, K.C., Arenales, M.N.: O problema de corte de estoque unidimensional multiper\u00edodo. Pesquisa Operacional 30, 153\u2013174 (2010)","journal-title":"Pesquisa Operacional"},{"key":"9547_CR65","first-page":"35","volume":"7","author":"MR Rao","year":"1976","unstructured":"Rao, M.R.: On the cutting stock problem. J. Comput. Soc. India 7, 35\u201339 (1976)","journal-title":"J. Comput. Soc. India"},{"key":"9547_CR66","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.ejor.2014.03.027","volume":"238","author":"S Rebennack","year":"2014","unstructured":"Rebennack, S., Kallrath, J., Kallrath, J., et al.: Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges. Eur. J. Oper. Res. 238, 374\u2013389 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9547_CR67","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejor.2009.03.042","volume":"201","author":"H Reinertsen","year":"2010","unstructured":"Reinertsen, H., Vossen, T.W.: The one-dimensional cutting stock problem with due dates. Eur. J. Oper. Res. 201(3), 701\u2013711 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9547_CR68","unstructured":"Respicio, A., Captivo, M., Rodrigues, A.: A DSS for production planning and scheduling in the paper industry. In: Proceedings of the International Conference On Decision Making and Decision Support in the Internet Age. University College Cork, Cork, Ireland, pp. 298\u2013308 (2002)"},{"issue":"18","key":"9547_CR69","doi-asserted-by":"publisher","first-page":"6111","DOI":"10.1007\/s00500-017-2666-8","volume":"22","author":"IAL Sanchez","year":"2018","unstructured":"Sanchez, I.A.L., Vargas, J.M., Santos, C.A., et al.: Solving binary cutting stock with matheuristics using particle swarm optimization and simulated annealing. Soft. Comput. 22(18), 6111\u20136119 (2018)","journal-title":"Soft. Comput."},{"key":"9547_CR70","doi-asserted-by":"crossref","unstructured":"Sezer, Z., Muter, \u0130.: Two-stage cutting stock problem with due dates. In: Operations Research Proceedings 2016, pp. 139\u2013145. Springer (2018)","DOI":"10.1007\/978-3-319-55702-1_20"},{"issue":"5","key":"9547_CR71","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1080\/01605682.2022.2085067","volume":"74","author":"CDA Signorini","year":"2023","unstructured":"Signorini, C.D.A., de Araujo, S.A., Poltroniere, S.C., Melega, G.M.: One-dimensional multi-period cutting stock problem with two stages applied to lattice slab production. J. Oper. Res. Soc. 74(5), 1378\u20131392 (2023). https:\/\/doi.org\/10.1080\/01605682.2022.2085067","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9547_CR72","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.ejor.2022.04.023","volume":"304","author":"EM Silva","year":"2023","unstructured":"Silva, E.M., Melega, G.M., Akartunali, K., et al.: Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost. Eur. J. Oper. Res. 304(2), 443\u2013460 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2022.04.023","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9547_CR73","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10732-015-9295-0","volume":"21","author":"CFM Toledo","year":"2015","unstructured":"Toledo, C.F.M., da Silva, Arantes M., Hossomi, M.Y.B., et al.: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J. Heuristics 21(5), 687\u2013717 (2015). https:\/\/doi.org\/10.1007\/s10732-015-9295-0","journal-title":"J. Heuristics"},{"issue":"5","key":"9547_CR74","first-page":"1093","volume":"86","author":"S Umetani","year":"2003","unstructured":"Umetani, S., Yagiura, M., Ibaraki, T.: An lp-based local search to the one dimensional cutting stock problem using a given number of cutting patterns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86(5), 1093\u20131102 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"9547_CR75","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10852-005-9031-0","volume":"5","author":"S Umetani","year":"2006","unstructured":"Umetani, S., Yagiura, M., Ibaraki, T.: One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming. J. Math. Model. Algorithms 5, 43\u201364 (2006)","journal-title":"J. Math. Model. Algorithms"},{"issue":"2","key":"9547_CR76","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"JM Val\u00e9rio de Carvalho","year":"2002","unstructured":"Val\u00e9rio de Carvalho, J.M.: LP models for bin packing and cutting stock problems. Eur. J. Oper. Res. 141(2), 253\u2013273 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9547_CR77","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1287\/opre.48.6.915.12391","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck, F.: Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Oper. Res. 48(6), 915\u2013926 (2000)","journal-title":"Oper. Res."},{"key":"9547_CR78","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.cor.2016.10.015","volume":"79","author":"M Vanzela","year":"2017","unstructured":"Vanzela, M., Melega, G.M., Rangel, S., et al.: The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production. Comput. Oper. Res. 79, 148\u2013160 (2017)","journal-title":"Comput. Oper. Res."},{"key":"9547_CR79","unstructured":"Velasco, A.S., Barboza, E.U.: Gera\u00e7\u00e3o de padroes de corte bidimensionais guilhotinados via GRASP (in portuguese). In: Proceedings of the XLVI Simp\u00f3sio Brasileiro de Pesquisa Operacional (SBPO 2014), Salvador, BA, Brazil, pp. 1\u201312 (2014)"},{"issue":"3","key":"9547_CR80","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01539705","volume":"18","author":"G W\u00e4scher","year":"1996","unstructured":"W\u00e4scher, G., Gau, T.: Heuristics for the integer one-dimensional cutting stock problem: a computational study. Oper. Res. Spektrum 18(3), 131\u2013144 (1996)","journal-title":"Oper. Res. Spektrum"},{"issue":"3","key":"9547_CR81","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.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9547_CR82","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"issue":"106","key":"9547_CR83","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.cor.2023.106403","volume":"161","author":"W Wu","year":"2024","unstructured":"Wu, W., Ito, M., Hu, Y., et al.: Heuristic algorithms based on column generation for an online product shipping problem. Comput. Oper. Res. 161(106), 403 (2024). https:\/\/doi.org\/10.1016\/j.cor.2023.106403","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9547_CR84","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.ejor.2017.07.036","volume":"265","author":"DA Wuttke","year":"2018","unstructured":"Wuttke, D.A., Heese, H.S.: Two-dimensional cutting stock problem with sequence dependent setup times. Eur. J. Oper. Res. 265(1), 303\u2013315 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.07.036","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09547-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09547-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09547-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T18:58:39Z","timestamp":1741460319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09547-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,4]]},"references-count":84,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["9547"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09547-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,4]]},"assertion":[{"value":"13 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors Elisama de Ara\u00fajo Silva Oliveira, Elizabeth FialhoWanner, S\u00e9rgio Ricardo de Souza, and Elisangela Martins de S\u00e1 declare that they have no conflict of interest. This work does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"16"}}