The problem of planning the layout of containers on board supply vessels can be reformulated as the problem of packing a given set of rectangles into a larger rectangle, subject to constraints. A method combining the use of guillotine cuts with forward checking is proposed, and compared to standard forward checking on finite domains. The initial results show that the method has potential for im...

We describe a new hierarchical 2D-guillotine Cutting Stock Problem. In contrast to the classic cutting stock problem, waste is not an issue. The problem relates to the removal of a defective part and assembly of the remaining parts into homogeneous size blocks. The context is the packing stages of cake manufacturing. The company’s primary objective is to minimise total processing time at the su...

This paper deals with the classical two-dimensional cutting stock problem, which consists of generating cutting patterns to produce bi rectangular items of sizes (li,wi), i=1,..,m, from rectangular objects of sizes (L,W), so that an objective is optimized, for example, the cost or trim loss. However, to cut the patterns they should be sequenced in such a way as to optimize another objective, fo...