Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem

References

• Akartunalı K, Miller AJ (2009) A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. 193(2):396–411.Crossref, Google Scholar
• Akartunalı K, Miller AJ (2012) A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. Appl. 53(3):729–753.Crossref, Google Scholar
• Akartunalı K, Fragkos I, Miller AJ, Wu T (2016) Local cuts and two-period convex hull closures for big-bucket lot-sizing problems. INFORMS J. Comput. 28(4):766–780.Link, Google Scholar
• Alem D, Morabito R (2012) Production planning in furniture settings via robust optimization. Comput. Oper. Res. 39(2):139–150.Crossref, Google Scholar
• Alem D, Morabito R (2013) Risk-averse two-stage stochastic programs in furniture plants. OR Spectrum 35(4):773–806.Crossref, Google Scholar
• Amor HB, de Carvalho JV (2005) Cutting stock problems. Desaulniers G, Desrosiers J, Solomon M, eds. Column Generation (Springer, New York), 131–161.Crossref, Google Scholar
• Arbib C, Marinelli F (2005) Integrating process optimization and inventory planning in cutting-stock with skiving option: An optimization model and its application. Eur. J. Oper. Res. 163(3):617–630.Crossref, Google Scholar
• Arbib C, Marinelli F (2014) On cutting stock with due dates. Omega 46:11–20.Crossref, Google Scholar
• Arbib C, Marinelli F, Rossi F, Di Iorio F (2002) Cutting and reuse: An application from automobile component manufacturing. Oper. Res. 50(6):923–934.Link, Google Scholar
• Ball M (2011) Heuristics based on mathematical programming. Surveys Oper. Res. Management Sci. 16(1):21–38.Crossref, Google Scholar
• Braga N, Alves C, Macedo R, Carvalho JV (2015) A model-based heuristic for the combined cutting stock and scheduling problem. Gervasi O, Murgante B, Misra S, Gavrilova ML, Alves Coutinho Rocha AM, Torre C, Taniar D, Apduhan BO, eds. Computational Science and Its Applications, Lecture Notes in Computer Science, Vol. 9156 (Springer, New York), 490–505.Crossref, Google Scholar
• Carvalho JMVD, Rodriguez AJG (1995) An LP-based approach to a two-stage cutting stock problem. Eur. J. Oper. Res. 84(3):580–589.Crossref, Google Scholar
• Clautiaux F, Alves C, de Carvalho JV (2010) A survey of dual-feasible and superadditive functions. Ann. Oper. Res. 179(1):317–342.Crossref, Google Scholar
• Coverdale I, Wharton F (1976) An improved heuristic procedure for a nonlinear cutting stock problem. Management Sci. 23(1):78–86.Link, Google Scholar
• Degraeve Z, Jans R (2007) A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 55(5):909–920.Link, Google Scholar
• Degraeve Z, Peeters M (2003) Optimal integer solutions to industrial cutting-stock problems: Part 2, benchmark results. INFORMS J. Comput. 15(1):58–81.Link, Google Scholar
• Desaulniers G, Desrosiers J, Solomon M, eds. (2005) Column Generation (Springer, New York).Crossref, Google Scholar
• du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194(1–3):229–237.Crossref, Google Scholar
• Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35(6):832–848.Link, Google Scholar
• Foerster H, Wäscher G (2000) Pattern reduction in one-dimensional cutting stock problems. Internat. J. Production Res. 38(7):1657–1676.Crossref, Google Scholar
• Fragkos I, Degraeve Z, De Reyck B (2016) A horizon decomposition approach for the capacitated lot-sizing problem with setup times. INFORMS J. Comput. 28(3):465–482.Link, Google Scholar
• Gendreau M, Potvin J-Y, eds. (2010) Handbook of Metaheuristics (Springer, New York).Crossref, Google Scholar
• Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math. Programming Study 2:82–114.Crossref, Google Scholar
• Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper. Res. 9(6):849–859.Link, Google Scholar
• Gilmore PC, Gomory RE (1963) A linear programming approach to the cutting stock problem—Part II. Oper. Res. 11(6):863–888.Link, Google Scholar
• Gramani MCN, França PM (2006) The combined cutting stock and lot-sizing problem in industrial processes. Eur. J. Oper. Res. 174(1):509–521.Crossref, Google Scholar
• Gramani MCN, França PM, Arenales MN (2009) A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem. Internat. J. Production Econom. 119(2):219–227.Crossref, Google Scholar
• Gramani MCN, França PM, Arenales MN (2011) A linear optimization approach to the combined production planning model. J. Franklin Institute 348(7):1523–1536.Crossref, Google Scholar
• Haessler RW (1971) A heuristic programming solution to a nonlinear cutting stock problem. Management Sci. 17(12):B-793–B-802.Link, Google Scholar
• Haessler RW (1975) Controlling cutting pattern changes in one-dimensional trim problems. Oper. Res. 23(3):483–493.Link, Google Scholar
• Haessler RW (1988) Selection and design of heuristic procedures for solving roll trim problems. Management Sci. 34(12):1460–1471.Link, Google Scholar
• Hendry LC, Fok KK, Shek KW (1996) A cutting stock scheduling problem in the copper industry. J. Oper. Res. Soc. 47(1):38–47.Crossref, Google Scholar
• Jans R, Degraeve Z (2004) Improved lower bounds for the capacitated lot sizing problem with setup times. Oper. Res. Lett. 32(2):185–195.Crossref, Google Scholar
• Krichagina EV, Rubio R, Taksar MI, Wein LM (1998) A dynamic stochastic stock-cutting problem. Oper. Res. 46(5):690–701.Link, Google Scholar
• Lefrançois P, Gascon A (1995) Solving a one-dimensional cutting-stock problem in a small manufacturing firm: A case study. IIE Trans. 27(4):483–496.Crossref, Google Scholar
• Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, Google Scholar
• Morabito R, Arenales M (2000) Optimizing the cutting of stock plates in a furniture company. Internat. J. Production Res. 38(12):2725–2742.Crossref, Google Scholar
• Nonås SL, Thorstenson A (2000) A combined cutting-stock and lot-sizing problem. Eur. J. Oper. Res. 120(2):327–342.Crossref, Google Scholar
• Nonås SL, Thorstenson A (2008) Solving a combined cutting-stock and lot-sizing problem with a column generating procedure. Comput. Oper. Res. 35(10):3371–3392.Crossref, Google Scholar
• Pochet Y, Wolsey LA, eds. (2006) Production Planning by Mixed Integer Programming (Springer, New York).Google Scholar
• Poltroniere SC, Poldi KC, Toledo FMB, Arenales MN (2008) A coupling cutting stock-lot sizing problem in the paper industry. Ann. Oper. Res. 157(1):91–104.Crossref, Google Scholar
• Reinders M (1992) Cutting stock optimization and integral production planning for centralized wood processing. Math. Comput. Modeling 16(1):37–55.Crossref, Google Scholar
• Stadtler H (2003) Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51(3):487–502.Link, Google Scholar
• Stowers CL, Palekar US (1997) Lot sizing problems with strong set-up interactions. IIE Trans. 29(2):167–179.Crossref, Google Scholar
• Vahrenkamp R (1996) Random search in the one-dimensional cutting stock problem. Eur. J. Oper. Res. 95(1):191–200.Crossref, Google Scholar
• Vanderbeck F (2000) Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Oper. Res. 48(6):915–926.Link, Google Scholar
• Wu T, Shi L, Geunes J, Akartunalı K (2011) An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. Eur. J. Oper. Res. 214(2):428–441.Crossref, Google Scholar
• Wu T, Shi L, Geunes J, Akartunalı K (2012) On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times. J. Global Optim. 53(4):615–639.Crossref, Google Scholar