Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6897401 | European Journal of Operational Research | 2014 | 8 Pages |
Abstract
In this article, we review published studies that consider the solution of the one-dimensional cutting stock problem (1DCSP) with the possibility of using leftovers to meet future demands, if long enough. The one-dimensional cutting stock problem with usable leftovers (1DCSPUL) is a problem frequently encountered in practical settings but often, it is not dealt with in an explicit manner. For each work reviewed, we present the application, the mathematical model if one is proposed and comments on the computational results obtained. The approaches are organized into three classes: heuristics, item-oriented, or cutting pattern-oriented.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Adriana Cristina Cherri, Marcos Nereu Arenales, Horacio Hideki Yanasse, Kelly Cristina Poldi, Andréa Carla Gonçalves Vianna,