Sequence selection of stock sheets in two-dimensional layout problems

Abstract

This paper introduces an optimization algorithm for finding the sequence of stock sheets to use in a two-dimensional bill-of-materials layout problem, when there is more than one size of stock sheet to choose from and when the method for laying each single sheet is already chosen. To reduce computer time and memory requirements for solving this problem, two other heuristic approaches are also proposed. Tests on data from a Wisconsin manufacturer show that the use of multiple sheet sizes can materially reduce the trim losses achieved from a layout system that uses only a single sheet size. The heuristic methods introduced represent progressive stages in the trade-off between layout quality and the computer time and memory required to achieve the layout.