TARU PUBLICATIONS
Journal of Information and Optimization Sciences cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0103·ISSN (Print): 0252-2667

WoS  JIF 2026 : 0.4 (Q4)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research on topics in information and optimization sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis
submissions@tarupublications.com
Open Access Research Article

A three-objective mathematical model for a one-dimensional cutting stock problem with trim loss recovery

* ,

* Corresponding author · click or hover a name for details

pp. 2491–2510Vol. 47Issue 6June 2026DOI: 10.47974/JIOS-1970XML
Received:
03 Dec 2024
Published Online:
11 Feb 2026
Article type:
Research Article
Language:
EN
Article no.:
JIOS-1970
Pages:
2491–2510

Abstract

In this study, we present a mathematical model with three objectives, by which we maximize the number of standard items in stock, by recovering the materials lost in the cutting process by welding, and minimize the total waste of raw materials and the number of modes to be carried out. We also propose a solution technique consisting of two steps, the first of which is to create the cutting matrix and the second of which is to find all possible solutions that satisfy the orders and from them all the efficient solutions, thanks to a subset of these cutting modes. In both steps, we recover lost materials through welding and form new standard items. Each solution features the number of standard items recovered by total waste weld, number of cutting modes, and total waste.

Keywords

Subject Classifications

90C29

References

[1] Y. Cui and Y. Yang, “A heuristic for the one-dimensional cutting stock problem with usable leftover,” European Journal of Operational Research, vol. 204, no. 2, pp. 245–250 (2010).
[2] S. C. Campello, C. T. Ghidini, A. O. C. Ayres, and W. A. Oliveira, “A multi-objective integrated model for lot sizing and cutting stock problems,” Journal of the Operational Research Society, vol. 71, no. 9, pp. 1466–1478 (2020).
[3] P. C. Gilmore and R. E. Gomory, “A linear programming approach to the cutting stock problem,” Operations Research, vol. 9, pp. 849–859 (1961).
[4] P. C. Gilmore and R. E. Gomory, “A linear programming approach to the cutting stock problem—Part II,” Operations Research, vol. 11, no. 6, pp. 863–888, 1963.
[5] P. C. Gilmore and R. E. Gomory, “Multistage cutting stock problems of two and more dimensions,” Operations Research, vol. 13, no. 1, pp. 94–120 (1965).
[6] R. W. Haessler, “A note on computational modifications to the Gilmore–Gomory cutting stock problem,” Operations Research, vol. 28, pp. 1001–1005 (1980).
[7] A. A. Farley, “Mathematical programming models for cutting-stock problems in the clothing industry,” Journal of the Operational Research Society, vol. 39, no. 1, pp. 41–53 (1988).
[8] S. Umetani, M. Yagiura, and T. Ibaraki, “One-dimensional cutting stock problem with a given number of setups: A hybrid approach of meta-heuristics and linear programming,” Journal of Mathematical Modelling and Algorithms, vol. 5, pp. 43–64 (2006).
[9] P. S. C. Oltroniere, K. C. Poldi, F. M. B. Toledo, and M. N. A. Arenales, “Coupling cutting stock lot sizing problem in the paper industry,” Annals of Operations Research, vol. 157, no. 1, pp. 91–104 (2008).
[10] J. De Armas, G. C. Miranda, and C. León, “A multi-objective approach for the 2D guillotine cutting stock problem,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6692, pt. 2, pp. 292–299 (2011).
[11] G. Wäscher and S. Henn, “Extensions of cutting problems, setups,” Pesquisa Operacional, vol. 33, no. 2, pp. 133–162 (2013).
[12] S. Araujo, K. C. Poldi, and J. Smith, “A genetic algorithm for the one-dimensional cutting stock problem with setups,” Pesquisa Operacional, vol. 34, no. 2, pp. 165–187 (2014), doi: 10.1590/0101-7438.2014034.020165.
[13] Y. Cui, C. Zhong, and Y. Yao, “Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost,” European Journal of Operational Research, vol. 243, no. 2 (2015), doi: 10.1016/j.ejor.2014.12.01.
[14] A. A. S. Leão, M. M. Furlan, and F. M. B. Toledo, “Decomposition methods for the lot sizing and cutting stock problems in paper industries,” Applied Mathematical Modelling, vol. 48, pp. 250–268 (2017).
[15] A. A. Filho, A. C. Moretti, and M. V. Pato, “A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem,” Journal of the Operational Research Society, vol. 69, no. 1, pp. 91–107 (2018).
[16] A. Mellouli, R. Mellouli, and F. Masmoudi, “An innovative genetic algorithm for a multi-objective optimization of two-dimensional cutting-stock problem,” Applied Artificial Intelligence, vol. 33, no. 6, pp. 531–547 (2019).
[17] S. M. Suliman, “Pattern generating procedure for the cutting stock problem,” International Journal of Production Economics, vol. 74, no. 1–3, pp. 293–301 (2001), doi: 10.1016/S0925-5273(01)00134-7.
[18] R. Golfeto, A. C. Moretti, and L. L. Salles-Neto, “A genetic symbiotic algorithm applied to the cutting-stock problem with multiple objectives,” Advanced Modeling and Optimization, vol. 11, pp. 473–501 (2009).

Views: 173Downloads: 28Citations: 0