An arc flow-based optimization approach for the two-stage guillotine strip cutting problem

Despite its broad range of industrial applications, the two‐stage guillotine restriction has received very scant attention in the strip cutting literature. An integer linear programming model that is based on a special graph structure is devised for this strongly NP‐hard problem. In addition to being easy to implement, the empirical study on a large set of instances from the literature and from real industrial world cases shows the efficiency of the proposed method while solving instances with high multiplicity factor.