Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481820 | European Journal of Operational Research | 2007 | 18 Pages |
Abstract
In this paper an integrated problem formulated as an integer linear programming problem is presented to find an optimal solution to the cutting stock problem under particular pattern sequencing constraints. The solution uses a Lagrangian approach. The dual problem is solved using a modified subgradient method. A heuristic for the integrated problem is also presented. The computational results obtained from a set of unidimensional instances that use these procedures are reported.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Horacio Hideki Yanasse, Maria José Pinto Lamosa,