Manufacturer´s s pallet loading problem

• Grant number: 07/02725-1
• Support Opportunities: Scholarships in Brazil - Master
• Start date: March 01, 2008
• End date: February 28, 2009
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Silvio Alexandre de Araujo
• Grantee: Bruna de Lima Alcântara Kitamura
• Host Institution: Instituto de Biociências, Letras e Ciências Exatas (IBILCE). Universidade Estadual Paulista (UNESP). Campus de São José do Rio Preto. São José do Rio Preto , SP, Brazil
• Associated research grant: 06/01665-2 - Lot sizing and integrated problems, AP.JP

Abstract

In this research project we intend to study a particular case of the Cutting and Packing Problem, the so called Manufacturer,s Pallet Loading Problem which consists in the problem of packing the maximum number of rectangles of sizes (l,w) or (w, l) into a larger rectangle (L,W) without overlapping. Several models proposed on the literature should be studied using computational packages. Moreover, heuristics based on lagrangian and surrogate relaxation also will be studied. The motivations to study these problems are the practical importance and the difficulty to solve, being necessary to develop sophisticated Mathematical/ Computational tools to solve them. It should be observed that this project is belongs to a Jovem Pesquisador project supported by FAPEP (process: 2006/01665-2) and a Temático project also supported by FAPESP (process: 2006/03496-3). (AU)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

KITAMURA, Bruna de Lima Alcântara. Heurística Surrogate para problema de carregamento de paletes dio produtor. 2009. Master's Dissertation - Universidade Estadual Paulista (Unesp). Instituto de Biociências Letras e Ciências Exatas. São José do Rio Preto São José do Rio Preto.