Algorithms for 3d guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing

We present algorithms for the following three-dimensional (3D) guillotine cutting problems: Un-bounded Knapsack, Cutting Stock and Strip Packing. We consider the case where the items have fixed orientation and the case where orthogonal rotations around all axes are allowed. For the Un-bounded 3D Knapsack problem, we extend the recurrence formula proposed by Beasley for the Rectangular Knapsack Problem and present a dynamic programming algorithm that uses reduced raster points. We also consider a variant of the Unbounded Knapsack problem in which the cuts must be staged. For the 3D Cutting Stock problem and its variants in which the bins have differ-ent sizes (and the cuts must be staged), we present column generation based algorithms. Modified versions of the algorithms for the 3D Cutting Stock problems with stages are then used to build algorithms for the 3D Strip Packing problem and its variants. The computational tests performed with the algorithms described in this paper indicate that they are useful to solve instances of mod-erate size