View the model
Download the model
LINGO model for Rectangular 2D cutting stock with guillotine cuts. Given: Raw material master rectangle of dimensions x1 by y1, and finished good (f.g.) rectangles i, of dimensions dx(i) by dy(i), Find a sequence of guillotine cuts x(j) and y(j), so as to maximize the value of the f.g. rectangles cut from the master. Cutting process is viewed as a binary tree, with node i having the two children: 2*i and 1+2*i. Each cut splits a rectangle into two smaller rectangles. Material may be isotropic, (rotate = 1)such as glass, so finished good may be rotated 90 degrees, or non-isotropic (rotate = 0) such as a heavily grained wood; Some of the ideas in this formulation were presented by Dyckhoff; Ref: Dyckhoff, H. (1981),"A New Linear Programming Approach to the Cutting Stock Problem," Operations Research, vol 29, no. 6, pp. 1092-1104.;