A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts

A Heuristic Approach for Two‐Dimensional Rectangular Cutting Stock Problem considering Balance for Material Utilization and Cutting Complexity

“…Nascimento et al [22] presented the 2DRCSP with guillotine cutting. ey considered the possibility of 2 and 3 cutting stages in a predefined sequence.…”

“…e first optimization method is based on the integer programming model, which is established according to the 2DRCSP with special constraints and solved with branch-and-bound or existing commercial solver such as CPLEX. Based on [3,10,13,20,22,25], the computational complexity is too high with large item type. e runtime of solving several instances is even over two hours.…”