A hybrid method for the lot sizing problem

Author(s)

Luiz Henrique Cherri

• Document type: Master's Dissertation
• Press: São Carlos.
• Institution: Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC/SB)
• Defense date: 2013-02-27

Examining board members

Franklina Maria Bragion de Toledo; Alysson Machado Costa; Paulo Morelato França

• Advisor: Franklina Maria Bragion de Toledo

Abstract

This paper proposes two methods to solve the capacitated lot-sizing problem with multiple products and parallel machines. The manufacturing of products consumes machines capacity (production time and setup time), which is scarce. The demand for the products is known and can be met with backlogging. The objective is to minimize the sum of production, setup, holding and backlog costs. In a first step, we developed a deterministic tabu search heuristic based on a random version from the literature and then conducted an analysis of the influence of random factors on tabu search heuristics when applied to solve the studied problem. Subsequently, we designed a hybrid method based on tabu search, branch-andcut and linear programming. Computational experiments show that this hybrid method is competitive with other heuristics presented in the literature (AU)

• FAPESP's process: 10/13934-3 - Hybrid method for lot sizing problem
• Grantee: Luiz Henrique Cherri
• Support Opportunities: Scholarships in Brazil - Master