The Two-Dimensional, Rectangular,Guillotineable-Layout Cutting Problemwith a Single Defect

In this paper, a two-dimensional cutting problem is consideredin which a single plate (large object) has to be cut down into a set of smallitems of maximal value. As opposed to standard cutting problems, thelarge object contains a defect, which must not be covered by a small item.The problem is represented by means of an AND/OR-graph, and a Branch& Bound procedure (including heuristic modifications for speeding up thesearch process) is introduced for its exact solution. The proposed methodis evaluated in a series of numerical experiments that are run on probleminstances taken from the literature, as well as on randomly generatedinstances...