Two-dimensional cutting stock problem with sequence dependent setup times

Choogin, 2013 Cui, 2015, Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost, European Journal of Operational Research, 243, 540, 10.1016/j.ejor.2014.12.015 Delorme, 2016, Bin packing and cutting stock problems: Mathematical models and exact algorithms, European Journal of Operational Research, 255, 1, 10.1016/j.ejor.2016.04.030 Dyson, 1974, The cutting stock problem in the flat glass industry, Operational Research Quarterly, 25, 41, 10.1057/jors.1974.5 Gilmore, 1963, A linear programming approach to the cutting stock problem: Part ii, Operations Research, 11, 863, 10.1287/opre.11.6.863 Gilmore, 1965, Multistage cutting stock problems of two and more dimensions, Operations Research, 13, 94, 10.1287/opre.13.1.94 Gilmore, 1961, A linear programming approach to the cutting-stock problem, Operations Research, 9, 849, 10.1287/opre.9.6.849 Haessler, 1975, Controlling cutting pattern changes in one-dimensional trim problems, Operations Research, 23, 483, 10.1287/opre.23.3.483 Hillier, 2001 Kallrath, 2014, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, European Journal of Operational Research, 238, 374, 10.1016/j.ejor.2014.03.027 Lübbecke, 2005, Selected topics in column generation, Operations Research, 53, 1007, 10.1287/opre.1050.0234 Malaguti, 2014, Approaches to real world two-dimensional cutting problems, Omega, 47, 99, 10.1016/j.omega.2013.08.007 Mobasher, 2013, Solution approaches for the cutting stock problem with setup cost, Computers & Operations Research, 40, 225, 10.1016/j.cor.2012.06.007 Reinertsen, 2010, The one-dimensional cutting stock problem with due dates, European Journal of Operational Research, 201, 701, 10.1016/j.ejor.2009.03.042 Rinaldi, 2007, A two-dimensional strip cutting problem with sequencing constraint, European Journal of Operational Research, 183, 1371, 10.1016/j.ejor.2005.12.050 Song, 2006, An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem, European Journal of Operational Research, 175, 1870, 10.1016/j.ejor.2004.10.034 Umetani, 2003, One-dimensional cutting stock problem to minimize the number of different patterns, European Journal of Operational Research, 146, 388, 10.1016/S0377-2217(02)00239-4 Wäscher, 2007, An improved typology of cutting and packing problems, European Journal of Operational Research, 183, 1109, 10.1016/j.ejor.2005.12.047 Yanasse, 1997, On a pattern sequencing problem to minimize the maximum number of open stacks, European Journal of Operational Research, 100, 454, 10.1016/S0377-2217(97)84107-0 Yanasse, 2007, An integrated cutting stock and sequencing problem, European Journal of Operational Research, 183, 1353, 10.1016/j.ejor.2005.09.054 Yuen, 1995, Establishing the optimality of sequencing heuristics for cutting stock problems, European Journal of Operational Research, 84, 590, 10.1016/0377-2217(95)00025-L