Solving a real-world large-scale cutting stock problem: A clustering-assignment-based model

References

• De Carvalho, J.V. (1999) Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research, 86, 629–659.
   Web of Science ®Google Scholar
• Delorme, M. and Iori, M. (2020) Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. INFORMS Journal on Computing, 32(1), 101–119.
   Web of Science ®Google Scholar
• Desaulniers, G., Desrosiers, J. and Solomon, M.M. (2006) Column Generation, Volume 5. Springer Science & Business Media, Berlin.
   Google Scholar
• Dyckhoff, H. (1981) A new linear programming approach to the cutting stock problem. Operations Research, 29(6), 1092–1104.
   Web of Science ®Google Scholar
• Furini, F., Malaguti, E., Durán, R.M., Persiani, A. and Toth, P. (2012) A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size. European Journal of Operational Research, 218(1), 251–260.
   Web of Science ®Google Scholar
• Gabrel, V. and Minoux, M. (2002) A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. Operations Research Letters, 30(4), 252–264.
   Web of Science ®Google Scholar
• Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco.
   Google Scholar
• Ghodsi, R. and Sassani, F. (2005) Real-time optimum sequencing of wood cutting process. International Journal of Production Research, 43(6), 1127–1141.
   Web of Science ®Google Scholar
• Gilmore, P.C. and Gomory, R.E. (1961) A linear programming approach to the cutting-stock problem. Operations Research, 9(6), 849–859.
   Web of Science ®Google Scholar
• Gilmore, P.C. and Gomory, R.E. (1963) A linear programming approach to the cutting stock problem—part ii. Operations Research, 11(6), 863–888.
   Web of Science ®Google Scholar
• Kallrath, J., Rebennack, S., Kallrath, J. and Kusche, R. (2014) Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges. European Journal of Operational Research, 238(1), 374–389.
   Web of Science ®Google Scholar
• Kantorovich, L.V. (1960) Mathematical methods of organizing and planning production. Management Science, 6(4), 366–422.
   Web of Science ®Google Scholar
• Kaparis, K. and Letchford, A.N. (2010) Separation algorithms for 0-1 knapsack polytopes. Mathematical programming, 124(1-2), 69–91.
   Web of Science ®Google Scholar
• Knutson, K., Kempf, K., Fowler, J. and Carlyle, M. (1999) Lot-to-order matching for a semiconductor assembly and test facility. IIE Transactions, 31(11), 1103–1111.
   Web of Science ®Google Scholar
• Lee, J., Kim, B.-i. and Johnson, A.L. (2013) A two-dimensional bin packing problem with size changeable items for the production of wind turbine flanges in the open die forging industry. IIE Transactions, 45(12), 1332–1344.
   Web of Science ®Google Scholar
• Lemos, F.K., Cherri, A.C. and de Araujo, S.A. (2020) The cutting stock problem with multiple manufacturing modes applied to a construction industry. International Journal of Production Research, 1–19.
   Web of Science ®Google Scholar
• Lodi, A. and Monaci, M. (2003) Integer linear programming models for 2-staged two-dimensional knapsack problems. Mathematical Programming, 94(2–3), 257–278.
   Web of Science ®Google Scholar
• Martinovic, J., Scheithauer, G. and de Carvalho, J.V. (2018) A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. European Journal of Operational Research, 266(2), 458–471.
   Web of Science ®Google Scholar
• Poldi, K.C. and Arenales, M.N. (2009) Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Computers & Operations Research, 36(6), 2074–2081.
   Web of Science ®Google Scholar
• Silva, E.M., Melega, G.M., Akartunalı, K. and de Araujo, S.A. (2023) Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost. European Journal of Operational Research, 304(2), 443–460.
   Web of Science ®Google Scholar
• Vanzela, M., Melega, G.M., Rangel, S. and de Araujo, S.A. (2017) The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production. Computers & Operations Research, 79, 148–160.
   Web of Science ®Google Scholar
• Wang, D., Xiao, F., Zhou, L. and Liang, Z. (2020) Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation. European Journal of Operational Research, 286(2), 547–563.
   Web of Science ®Google Scholar
• Wäscher, G. and Gau, T. (1996) Heuristics for the integer one-dimensional cutting stock problem: A computational study. Operations-Research-Spektrum, 18(3), 131–144.
   Google Scholar
• Wäscher, G., Haußner, H. and Schumann, H. (2007) An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109–1130.
   Web of Science ®Google Scholar
• Wu, T., Akartunal i, K., Jans, R. and Liang, Z. (2017) Progressive selection method for the coupled lot-sizing and cutting-stock problem. INFORMS Journal on Computing, 29(3), 523–543.
   Web of Science ®Google Scholar
• Wuttke, D.A. and Heese, H.S. (2018) Two-dimensional cutting stock problem with sequence dependent setup times. European Journal of Operational Research, 265(1), 303–315.
   Web of Science ®Google Scholar
• Xu, Y.-x. (2016) An efficient heuristic approach for irregular cutting stock problem in ship building industry. Mathematical Problems in Engineering, 2016, 8703782.
   Web of Science ®Google Scholar