Mathematical models for the one-dimensional cutting stock problem with setups and open stacks

Gabriel Gazzinelli Guimarães (), Kelly Cristina Poldi () and Mateus Martin ()
Additional contact information
Gabriel Gazzinelli Guimarães: Universidade Estadual de Campinas (UNICAMP)
Kelly Cristina Poldi: Universidade Estadual de Campinas (UNICAMP)
Mateus Martin: Universidade Federal de São Carlos (UFSCar)

Journal of Combinatorial Optimization, 2025, vol. 49, issue 3, No 8, 35 pages

Abstract: Abstract In real-life production, the cutting stock problem is often associated with additional constraints and objectives. Among the auxiliary objectives, two of the most relevant are the minimization of the number of different cutting patterns used and the minimization of the maximum number of simultaneously open stacks. The first auxiliary objective arises in manufacturing environments where the adjustment of the cutting tools when changing the cutting patterns incurs increased costs and time spent in production. The second is crucial to face scenarios where the space near the cutting machine or the number of automatic unloading stations is limited. In this paper, we address the one-dimensional cutting stock problem, considering the additional goals of minimizing the number of different cutting patterns used and the maximum number of simultaneously open stacks. We propose two Integer Linear Programming (ILP) formulations and a Constraint Programming (CP) model for the problem. Moreover, we develop new upper bounds on the frequency of the cutting patterns in a solution and address some special cases in which the problem may be simplified. All three approaches are embedded into an iterative exact framework to find efficient solutions. We perform computational experiments using two sets of instances from the literature. The proposed approaches proved effective in determining the entire Pareto front for small problem instances, and several solutions for medium-sized instances with minimum trim loss, a reduced maximum number of simultaneously open stacks, and a small number of different used cutting patterns.

Keywords: Cutting stock problem; Open stacks; Pattern sequencing; Setup cost; Mathematical formulation; Integer linear programming; Constraint Programming (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01276-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01276-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01276-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().