MIP models for two-dimensional non-guillotine cutting problems with usable leftovers

Abstract

In this study we deal with the two-dimensional non-guillotine cutting problem of how to cut a set of larger rectangular objects to a set of smaller rectangular items in exactly a demanded number of pieces. We are concerned with the special case of the problem in which the non-used material of the cutting patterns (objects leftovers) may be used in the future, for example if it is large enough to fulfill future item demands. Therefore, the problem is seen as a two-dimensional non-guillotine cutting/packing problem with usable leftovers, also known in the literature as a two-dimensional residual bin-packing problem. We use multilevel mathematical programming models to represent the problem appropriately, which basically consists of cutting the ordered items using a set of objects of minimum cost, among all possible solutions of minimum cost, choosing one that maximizes the value of the usable leftovers, and, among them, selecting one that minimizes the number of usable leftovers. Because of special characteristics of these multilevel models, they can be reformulated as one-level mixed integer programming (MIP) models. Illustrative numerical examples are presented and analysed.

Keywords:

• Two-dimensional cutting with usable leftovers
• MIP models
• non-guillotine cutting and packing
• multilevel mathematical programming
• residual bin-packing problem

Acknowledgements

This work was supported by PRONEX-CNPq/FAPERJ E-26/111.449/2010–APQ1, FAPESP 2010/10133–0, 2013/05475–7, and 2013/07375–0, and CNPq.