Reformulations for batch sizing problems

• Grant number: 17/14358-5
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: September 01, 2017
• End date: August 31, 2019
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Silvio Alexandre de Araujo
• Grantee: Maurício Rocha Gonçalves
• 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: 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings, AP.TEM

Abstract

In some industries, decisions about the production activities needed to transform raw materials into final items in the most efficient way possible are closely related to decisions on the lots of final items that must be produced, and in this context, arises the lot sizing problem, which basically, consists of determining the production lot sizes (ie, quantities to be produced of each item) in each period of the planning horizon in order to minimize production costs or to maximize the profit, respecting constraints of availability of resources and meeting the demand of the items. The objective of this work is to study strong reformulations for this problem, such as reformulations based on the shortest path problem and the facility location problem. Reformulations will be implemented in modeling language and will be solved by optimization packages in order to compare them. (AU)