Heuristics for the cutting stock problem with usable leftovers

• Grant number: 13/18607-9
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: October 01, 2013
• End date: August 31, 2015
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Adriana Cristina Cherri
• Grantee: Douglas Nogueira Do Nascimento
• Host Institution: Faculdade de Ciências (FC). Universidade Estadual Paulista (UNESP). Campus de Bauru. Bauru , SP, Brazil
• Associated research grant: 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings, AP.TEM

Abstract

In the cutting stock problems, a set of items must be produced from a set of available objects in stock in order to optimize an objective function. These problems have several industrial applications and have been extensively studied in the literature. The relevance for the study of these problems arises from the increasing stimulus that industries in general have received to optimize their processes. This stimulation occurs, among other causes, by the greater competition imposed by the changes that have affected the world economic order. Therefore, in this project, we will study the one-dimensional cutting stock problems and we will consider that leftovers of material (cut piece, but not demanded) can return to stock to be used in the future. The study that involves the usable leftovers for cutting stock problems is recent and to solve this problem, we will use a mathematical model that has been studied to solve the one-dimensional cutting stock problems with usable leftovers (1DCSPUL). Computational implementations will be developed and to verify the performance of the proposed strategies, computational tests will be realized with random generated instances, instances from the literature and, if possible, with real problems. (AU)