%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@resumeid 8JMKD3MGP5W/3C9JHCP
%@archivingpolicy denypublisher denyfinaldraft36
%@usergroup administrator
%@usergroup simone
%3 an integrated cutting stock.pdf
%X 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.
%8 Dec.
%N 3
%T An integrated cutting stock and sequencing problem
%@secondarytype PRE PI
%K Cutting, Pattern sequencing, Integrated problem, Decomposition, Lagrangian relaxation.
%@visibility shown
%@group LAC-INPE-MCT-BR
%@secondarykey INPE-15023-PRE/9934
%@copyholder SID/SCD
%@issn 0377-2217
%2 sid.inpe.br/mtc-m17@80/2007/12.03.13.32.39
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@affiliation Comando Tecnológico Aeroespacial (CTA)
%B European Journal of Operational Research
%P 1353-1370
%4 sid.inpe.br/mtc-m17@80/2007/12.03.13.32.38
%D 2007
%V 183
%A Yanasse, Horacio Hideki,
%A Lamosa, Maria José Pinto,
%@dissemination WEBSCI; PORTALCAPES.
%@area COMP