The cutting stock problem is a classic problem of combinatorial optimization.However, the variant of the problem with two-dimensional irregular items has been scarcely explored.In this problem, the items have a free shape and must be located within a set of identical sheets with fixed dimensions.The main objective is to minimize waste, which is the same as reducing the number of bins where a specific demand for objects can fit.In this work, the items can be rotated freely and be placed without a fixed orientation; this allows the solution of this problem to be more consistent with the different applications in the industry where it appears.