Advanced search
Start date
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over

Full text
Carvalho, Desiree M. [1] ; Nascimento, Maria C. V. [1]
Total Authors: 2
[1] Univ Fed Sao Paulo UNIFESP, Inst Ciencia & Tecnol, Av Cesare G Lattes 1201, Sao Jose Dos Campos, SP - Brazil
Total Affiliations: 1
Document type: Journal article
Source: Computers & Operations Research; v. 100, p. 43-53, DEC 2018.
Web of Science Citations: 0

Lot sizing is one of the most challenging problems in production planning. This paper focuses on the multi-plant capacitated lot sizing problem (MPCLSP) with setup carry-over (MPCLSP-SC). To the best of our knowledge, the MPCLSP-SC has been the subject of one single study, despite the fact that it can bring financial benefits, primarily by considering case studies under tight capacity. Moreover, in spite of the significant improvement in the performance of benchmark optimization solvers over the years, they are still very time and memory consuming for large MPCLSP instances. Therefore, heuristics stand out among the solution methods to tackle this type of problem. This paper introduces a novel matheuristic, a kernel search (KS) method, to solve the MPCLSP-SC. Through computational experiments, it was possible to show the outstanding performance of the proposed method for large instances with diverse characteristics. The experiments also demonstrate that the introduced KS outperformed state-of-the-art methods to solve the MPCLSP. (C) 2018 Elsevier Ltd. All rights reserved. (AU)

FAPESP's process: 16/02537-0 - Approaches to the integrated lot sizing and scheduling problem in parallel machines
Grantee:Desiree Maldonado Carvalho
Support type: Scholarships in Brazil - Doctorate
FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:José Alberto Cuminato
Support type: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 15/21660-4 - Hibridizing heuristic and exact methods to approach combinatorial optimization problems
Grantee:Mariá Cristina Vasconcelos Nascimento Rosset
Support type: Regular Research Grants