Article ID: | iaor19961250 |
Country: | Netherlands |
Volume: | 64 |
Issue: | 3 |
Start Page Number: | 410 |
End Page Number: | 422 |
Publication Date: | Feb 1993 |
Journal: | European Journal of Operational Research |
Authors: | Agrawal P.K. |
Keywords: | combinatorial analysis |
When a rectangular sheet is cut into smaller rectangles, or blanks, there may be trim loss. This paper proposes a method to minimise trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts. The problem is structured as a branch-and-bound technique and its optimal solution is guaranteed. Experimental computations show that the method is extremely efficient. In most cases, the optimal layout is found in a fraction of a second of computer time. The method can also be used for determining layout of identical boxes on pallets. However, since this problem does not have the constraint of guillotine cut, the best layout found using this method may not be optimal in some cases.