Lot sizing problems: integrations and solution methods

• Grant number: 11/22647-0
• Support Opportunities: Regular Research Grants
• Duration: June 01, 2012 - May 31, 2014
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Silvio Alexandre de Araujo
• Grantee: Silvio Alexandre de Araujo
• 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 researchers: Maria Do Socorro Nogueira Rangel

Abstract

In 2007 the applicant has started to develop financial supported projects on lot sizing problems integrated to other problems of optimization of the productive system. The applicant has done several contributions on the integration of the lot sizing problem with the scheduling problem, with the cutting and packing problem and with decisions related to the transportation of the produced items. In general, such contributions to present heuristics methods specifics to each investigated problem.Following the planning of these projects and aiming to study solution methods, the applicant engaged in a post-doctorate with Professor Zeger Degraeve from London Business School with financial support of Fapesp. In this occasion the applicant also met Professor Raf Jans from Department of Logistics and Operations Management/HEC Montréal. Professors Zeger Degraeve and Raf Jans have published several papers on integrated lot sizing problems and also on solution methods for the lot sizing problems. Such methods are related to reformations and Lagrange relaxation combined (or not) with column generation.In this project we intent to carry on the research related to the projects developed, as well as, the studies related to the post-doctorate. To do so, we intend to study the integrated lot sizing problem amplifying the studies related to mathematical models and solution methods applied to several industrial sectors. The aim is to propose and evaluate the efficiency of mathematical models that combine several aspects of the production planning. Related to the solution methods studied during the post-doctorate, we aim to continue the research on the application of these methods to the lot sizing problem. Moreover, we intend to start the investigation to apply these methods to extensions of the classical lot sizing problem, such as, the parallel machines case; the case with several plants; and the integrated lot sizing problems with emphasis to the lot sizing problem integrated to the cutting and packing problem. (AU)

Scientific publications

(4)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

FIOROTTO, DIEGO JACINTO; DE ARAUJO, SILVIO ALEXANDRE. Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines. ANNALS OF OPERATIONS RESEARCH, v. 217, n. 1, p. 213-231, JUN 2014. (11/22647-0, 10/16727-9)

SILVIO ALEXANDRE DE ARAUJO; KELLY CRISTINA POLDI; JIM SMITH. A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS. Pesquisa Operacional, v. 34, n. 2, p. 165-187, 2014-08-00. (12/00464-4, 11/22647-0)

G.M. MELEGA; D.J. FIOROTTO; S.A. DE ARAUJO. Formulações fortes para o problema de dimensionamento de lotes com várias plantas. TEMA (São Carlos), v. 14, n. 3, p. 305-318, 2013-12-00. (10/16727-9, 10/12796-6, 11/22647-0)

FIOROTTO, DIEGO JACINTO; DE ARAUJO, SILVIO ALEXANDRE; JANS, RAF. Hybrid methods for lot sizing on parallel machines. Computers & Operations Research, v. 63, p. 136-148, NOV 2015. (11/22647-0, 10/16727-9, 13/00965-6)