An enumeration scheme to generate constrained exact checkerboard patterns

  • Authors:

  • Horacio Hideki Yanasse;Daniel Massaru Katsurayama

  • Affiliations:

  • Laboratory for Computing and Applied Mathematics - LAC, National Space Research Institute - INPE/Brazil, INPE/LAC - P.O. Box 515, 12201-970 - Sao Jose dos Campos, SP, Brazil;Laboratory for Computing and Applied Mathematics - LAC, National Space Research Institute - INPE/Brazil, INPE/LAC - P.O. Box 515, 12201-970 - Sao Jose dos Campos, SP, Brazil

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Checkerboard patterns belong to a special class of 2-stage guillotine patterns that require less machine time to be cut. In this paper we propose an enumerative algorithm to generate exact constrained checkerboard patterns. At each node of the enumeration tree a constructive procedure is used to generate a feasible pattern. In addition, an upper bound on the objective function value is calculated to decide whether further branching from the node is worth. The algorithm was implemented and computational tests were performed. The test results indicate that the proposed scheme outperforms previous methods of the literature in terms of execution times.