Two-dimensional Cutting Stock with Multiple Stock Sizes

In this paper an algorithm for a cutting stock problem in the wood industry is presented. Cuts are of guillotine type and requirements have to be met exactly, i.e. no over- or under-production is allowed. There are several different board sizes from which panels can be cut and the problem is to find the best mix of boards and respective cutting patterns that satisfies the demand for panels with minimum wastage. The heuristic algorithm uses a pattern-building procedure combined with an enumeration scheme for the mix of boards.