RWTH Aachen University, Germany
Two-Stage Three-Dimensional Guillotine Cutting, Residual Bin-Packing Problem, Mixed Integer Programming Model, Reuseable Leftovers.
Automation of Operations
Knowledge Discovery and Information Retrieval
Methodologies and Technologies
In this paper, we consider the two-stage three-dimensional guillotine cutting stock problem with usable leftover. There are two properties that distinguish our problem formulation from others. First, we allow the items to be rotated. Second, we consider the case in which leftover material is to be reused in subsequent production cycles. Third, we solve the problem in three dimensions. The optimization problem is formulated as a mixed integer linear program. To verify the approach, several examples show that our formulation performs well.