Abstract
The efficient solution of practical problems combining both cutting stock and scheduling aspects has motivated the development of several approaches described recently in the literature. These problems consist in determining a cutting plan that minimises both the waste generated by cutting the stock rolls and the tardiness related to the delivery of items later than their specified due date. In this paper, we review two exact formulations proposed recently, which differ essentially on their strength and size. The first one is a compact model, which can be strengthened using knapsack-based inequalities. The other is a pseudo-polynomial model based on arc flows. Additionally, we explore a matheuristic approach based on a variant of the arc flow model that proved to be effective for solving medium scale instances. Computational results are provided and discussed at the end of the paper.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
