A heuristic for the one-dimensional cutting stock problem with usable letfover

• Grant number: 12/20577-8
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: December 01, 2012
• End date: January 31, 2013
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Antonio Carlos Moretti
• Grantee: Mateus Pereira Martin
• Host Institution: Faculdade de Ciências Aplicadas (FCA). Universidade Estadual de Campinas (UNICAMP). Limeira , SP, Brazil

Abstract

A cutting problem is "to determine" how best to cut a set of objects, i.e. of parts available in stock to produce a series of smaller units, usually called items, quantities from previously demanded. In one-dimensional cutting stock problems, just the width of demanded items is relevant, where such items must be well-matched so that the loss caused by the cutting pattern generated is the lowest possible - the minimization of losses - that is, the common feature of cutting stock problems. However, there is the possibility of large losses generated are sufficient and can be reused in future cutting patterns, and thus should not be considered "losses", but "leftovers" - featuring the cutting problem with usable leftovers. In this project, we are interested in studying mathematical models (linear and heuristic procedures) to analyze such problems in order to question the basic problem: "analysis of solutions of solutions with minimal loss versus reusable leftovers." The theoretical framework is the main heuristic presented by Cui and Yang (2010). We also intend to implement the heuristics studied.(AU)