| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] UNESP Univ Estadual Paulista, IBILCE, Dept Matemat Aplicada, BR-15054000 Sao Jose Do Rio Preto, SP - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | ANNALS OF OPERATIONS RESEARCH; v. 217, n. 1, p. 213-231, JUN 2014. |
| Web of Science Citations: | 10 |
| Abstract | |
We consider the capacitated lot sizing problem with multiple items, setup time and unrelated parallel machines. The aim of the article is to develop a Lagrangian heuristic to obtain good solutions to this problem and good lower bounds to certify the quality of solutions. Based on a strong reformulation of the problem as a shortest path problem, the Lagrangian relaxation is applied to the demand constraints (flow constraint) and the relaxed problem is decomposed per period and per machine. The subgradient optimization method is used to update the Lagrangian multipliers. A primal heuristic, based on transfers of production, is designed to generate feasible solutions (upper bounds). Computational results using data from the literature are presented and show that our method is efficient, produces lower bounds of good quality and competitive upper bounds, when compared with the bounds produced by another method from the literature and by high-performance MIP software. (AU) | |
| FAPESP's process: | 11/22647-0 - Lot sizing problems: integrations and solution methods |
| Grantee: | Silvio Alexandre de Araujo |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 10/16727-9 - LAGRANGE RELAXATION AND DANTZIG-WOLFE DECOMPOSITION: APPLICATION TO THE LOT-SIZING PROBLEM WITH PARALLEL MACHINES |
| Grantee: | Diego Jacinto Fiorotto |
| Support Opportunities: | Scholarships in Brazil - Doctorate |