Asset Details
Do you wish to reserve the book?
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
Do you wish to request the book?
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Mathematical models for the one-dimensional cutting stock problem with setups and open stacks
2025
Overview
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.
Publisher
Springer US,Springer Nature B.V
