%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@archivingpolicy denypublisher denyfinaldraft
%3 j.1475-3995.2005.00488.x.pdf
%X Checkerboard patterns, also known as 1-group patterns, belong to a special class of 2-stage guillotine patterns that do not need recuts. Such patterns are easier to cut, hence, they demand less machine time. They are of particular interest in high-demand settings when the machine is a bottleneck for production. We propose a heuristic and an exact method to determine such patterns. Both are two-phase methods: in the first phase, good combinations within strips are obtained and, afterwards, a good combination of strips is determined. Both methods outperform previous methods proposed in the literature, in terms of quality or in terms of computational times.
%T Checkerboard patterns: proposals for its generation
%@electronicmailaddress horacio@lac.inpe.br
%@electronicmailaddress massaru@lac.inpe.br
%K checkerboard pattern, enumerative algorithm, heuristic, productivity analysis.
%@secondarytype PRE PI
%@usergroup administrator
%@usergroup marciana
%@usergroup simone
%@group LAC-INPE-MCT-BR
%@group LAC-INPE-MCT-BR
%@secondarykey INPE--PRE/
%@issn 0969-6016
%2 sid.inpe.br/iris@1916/2005/12.14.15.22.11
%@affiliation Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática  Aplicada, (INPE, LAC)
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%B International Transactions in Operational Research
%@versiontype publisher
%P 21-45
%4 sid.inpe.br/iris@1916/2005/12.14.15.22
%@documentstage not transferred
%D 2005
%V 12
%A Yanasse, H. H.,
%A Katsurayama, D. M.,
%@dissemination WEBSCI; PORTALCAPES.
%@area COMP