Advanced search
Start date
Betweenand


Hybrid methods for the lot-sizing problem with multiple plants

Full text
Author(s):
Daniel Henrique Silva
Total Authors: 1
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:
Examining board members:
Franklina Maria Bragion de Toledo; Cláudio Fabiano Motta Toledo; Eli Angela Vitor Toso
Advisor: Franklina Maria Bragion de Toledo
Abstract

In this work, we present a study about the multi-plant, multi-item, multi-period lot-sizing problem. The plants have limited capacity, and the production of each item implies in setup times and setup costs. Our objective is to find a production plan which satisfies the demand of every client, considering that the sum of the production, stocking, transport and setup costs is the lowest possible. This work has two main contributions. Firstly, we propose the multi-plant lot-sizing problem modeling using the facility location concept. For small dimension problems, computational tests showed that the remodeled problem resolution presents, as expected, better results than the original model. However, the great number of restrictions and variables make bigger instances to be intractable. To work with the bigger dimension instances, we propose a hybrid method (math-heuristic), which combines the relax-and-fix method and the local branching restriction. Computational tests show that the proposed math-heuristic presents good quality feasible solutions for these instances (AU)

FAPESP's process: 11/03119-3 - Hybrid methods for the multi-plant lot sizing problem
Grantee:Daniel Henrique Silva
Support Opportunities: Scholarships in Brazil - Master