An algorithm for the special two-dimensional cutting problem

This paper deals with a special case of the two-dimensional cutting problem in which a specified number of rectangular blanks of a single size are required to be cut from rectangular sheets by using orthogonal guillotine cuts in such a way that sheet material will be saved. It is shown how this problem can be decomposed into two cutting sub-problems based on optimal layouts for three sections, and these can be expressed as integer nonlinear programming models respectively. Furthermore, algorithms for solving the two problems are proposed respectively, based on the numerical method, to obtain a global optimal solution. The effectiveness of the algorithms as well as the cutting procedure is illustrated in detail, by a numerical example. All the given algorithms are implemented on a microcomputer and experimented using a real data from a small manufacturing firm