|
|||||
|
|
An integrated cutting stock and sequencing problem |
|
| Authors: | Horacio Hideki Yanasse,Maria José Pinto Lamosa |
| Affiliation: | 1. National Space Research Center – Brazil (INPE), Special Technologies Center, Av. dos Astronautas, 1758-Jd. da Granja, CEP 12227-010, São José dos Campos, SP, Brazil;2. Aerospace Technology Command (CTA), Institute of Advanced Studies (IEAv), P.O. Box 6044, CEP 12228-970, São José dos Campos, SP, Brazil |
| 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. |
| Keywords: | Cutting Pattern sequencing Integrated problem Decomposition Lagrangian relaxation |
| 本文献已被 ScienceDirect 等数据库收录！ | |