An improved version of Wang’s algorithm for two-dimensional cutting problems

This paper deals with the two-dimensional cutting problem in which the pieces involved in the cutting process are rectangles and the number of times a piece may appear in a cutting pattern is bounded. A modified algorithm, which is an improved version of Wang’s algorithm, is presented. The computational performance of both algorithms is illustrated and compared by tests applied to a large number of randomly generated problems. The algorithms were implemented in a microcomputer.