DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Pesquisa operacional (Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382021000500404 |
Resumo: | ABSTRACT In this paper, we propose a novel MIP-based heuristic method to deal with a lot sizing and scheduling problem with multiple heterogeneous production lines in a production setting with perishable items. The problem is inspired by the production processes adopted by some Brazilian food industries and it considers that several production lines share the same scarce production resources. Therefore, only a subset of those lines can simultaneously operate in each production period. Moreover, the production environment is characterized by the existence of sequence-dependent setup times and costs, and by the production of perishable items which can be stocked for a short period only. Firstly, we propose a facility location reformulation for a model previously proposed in the literature. Secondly, we propose a heuristic composed of two phases. The first phase has an elaborated approach to building feasible solutions solving initially an aggregated lot sizing problem to decide which production lines to assemble, followed by the resolution of the various single line lot sizing and scheduling problems. The second phase applies improvement heuristics exploring principles of fix-and-optimize and local branching procedures. Computational results carried out using a data set proposed in the literature are presented in order to study the efficiency of the proposed approach. The results demonstrate that our heuristics provide superior results when benchmarked with a heuristic from the literature specifically developed to solve the problem under consideration, and with a commercial MIP solver. |
id |
SOBRAPO-1_828d426a2c3920cc31ae154edd50c732 |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382021000500404 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTSlot sizing and schedulingscarce resourcesperishable productsdecomposition heuristicABSTRACT In this paper, we propose a novel MIP-based heuristic method to deal with a lot sizing and scheduling problem with multiple heterogeneous production lines in a production setting with perishable items. The problem is inspired by the production processes adopted by some Brazilian food industries and it considers that several production lines share the same scarce production resources. Therefore, only a subset of those lines can simultaneously operate in each production period. Moreover, the production environment is characterized by the existence of sequence-dependent setup times and costs, and by the production of perishable items which can be stocked for a short period only. Firstly, we propose a facility location reformulation for a model previously proposed in the literature. Secondly, we propose a heuristic composed of two phases. The first phase has an elaborated approach to building feasible solutions solving initially an aggregated lot sizing problem to decide which production lines to assemble, followed by the resolution of the various single line lot sizing and scheduling problems. The second phase applies improvement heuristics exploring principles of fix-and-optimize and local branching procedures. Computational results carried out using a data set proposed in the literature are presented in order to study the efficiency of the proposed approach. The results demonstrate that our heuristics provide superior results when benchmarked with a heuristic from the literature specifically developed to solve the problem under consideration, and with a commercial MIP solver.Sociedade Brasileira de Pesquisa Operacional2021-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382021000500404Pesquisa Operacional v.41 n.spe 2021reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2021.041s1.00240377info:eu-repo/semantics/openAccessSoler,Willy A. de OliveiraSantos,Maristela O.Akartunalı,Keremeng2021-06-09T00:00:00Zoai:scielo:S0101-74382021000500404Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2021-06-09T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS |
title |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS |
spellingShingle |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS Soler,Willy A. de Oliveira lot sizing and scheduling scarce resources perishable products decomposition heuristic |
title_short |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS |
title_full |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS |
title_fullStr |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS |
title_full_unstemmed |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS |
title_sort |
DECOMPOSITION BASED HEURISTICS FOR A LOT SIZING AND SCHEDULING PROBLEM ON MULTIPLE HETEROGENEOUS PRODUCTION LINES WITH PERISHABLE PRODUCTS |
author |
Soler,Willy A. de Oliveira |
author_facet |
Soler,Willy A. de Oliveira Santos,Maristela O. Akartunalı,Kerem |
author_role |
author |
author2 |
Santos,Maristela O. Akartunalı,Kerem |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Soler,Willy A. de Oliveira Santos,Maristela O. Akartunalı,Kerem |
dc.subject.por.fl_str_mv |
lot sizing and scheduling scarce resources perishable products decomposition heuristic |
topic |
lot sizing and scheduling scarce resources perishable products decomposition heuristic |
description |
ABSTRACT In this paper, we propose a novel MIP-based heuristic method to deal with a lot sizing and scheduling problem with multiple heterogeneous production lines in a production setting with perishable items. The problem is inspired by the production processes adopted by some Brazilian food industries and it considers that several production lines share the same scarce production resources. Therefore, only a subset of those lines can simultaneously operate in each production period. Moreover, the production environment is characterized by the existence of sequence-dependent setup times and costs, and by the production of perishable items which can be stocked for a short period only. Firstly, we propose a facility location reformulation for a model previously proposed in the literature. Secondly, we propose a heuristic composed of two phases. The first phase has an elaborated approach to building feasible solutions solving initially an aggregated lot sizing problem to decide which production lines to assemble, followed by the resolution of the various single line lot sizing and scheduling problems. The second phase applies improvement heuristics exploring principles of fix-and-optimize and local branching procedures. Computational results carried out using a data set proposed in the literature are presented in order to study the efficiency of the proposed approach. The results demonstrate that our heuristics provide superior results when benchmarked with a heuristic from the literature specifically developed to solve the problem under consideration, and with a commercial MIP solver. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-01-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382021000500404 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382021000500404 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/0101-7438.2021.041s1.00240377 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
dc.source.none.fl_str_mv |
Pesquisa Operacional v.41 n.spe 2021 reponame:Pesquisa operacional (Online) instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) instacron:SOBRAPO |
instname_str |
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
instacron_str |
SOBRAPO |
institution |
SOBRAPO |
reponame_str |
Pesquisa operacional (Online) |
collection |
Pesquisa operacional (Online) |
repository.name.fl_str_mv |
Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
repository.mail.fl_str_mv |
||sobrapo@sobrapo.org.br |
_version_ |
1750318018486861824 |