The one-dimensional cutting stock problem with usable leftovers differs from a classical cutting stock problem by allowing that leftovers be planned and generated for stock during the cutting process and are not computed as waste. Since they are available in stock, they can be used to meet the demand of items. In this project, heuristic procedures will be proposed to obtain integer solutions to the one-dimensional usable leftovers problem. The study will be supported in a mathematical model proposed in the literature to solve the problem in that only continuous solutions were presented. Implementations will be developed. To verify the performance of the proposed procedures, computational tests will be performed with randomly generated instances and with instances from the literature. Comparisons and analysis between the solutions obtained by the proposed procedures will be also performed.
News published in Agência FAPESP Newsletter about the scholarship: