A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512017000300515 |
Resumo: | ABSTRACT In this paper, we deal with the Capacitated Lot Sizing and Scheduling Problem with sequence dependent setup times and costs - CLSD model. More specifically, we propose a simple reformulation for the CLSD model that enables us to define a new branching rule to be used in Branch-and-Bound (or Branch-and-Cut) algorithms to solve this NP-hard problem. Our branching rule can be easily implemented in commercial solvers. Computational tests performed in 240 test instances from the literature show that our approach can significantly reduce the running time to solve this problem using a Branch-and-Cut algorithm of a commercial MIP solver. Therefore, our approach can also improve the performance of other approaches that need to solve partial sub problems of the CLSD model in each iteration, such as Lagrangian approaches and heuristics based on the mathematical formulation of the problem. |
id |
SBMAC-1_14871ffb2a6d205f3f6184fb5729afb4 |
---|---|
oai_identifier_str |
oai:scielo:S2179-84512017000300515 |
network_acronym_str |
SBMAC-1 |
network_name_str |
TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) |
repository_id_str |
|
spelling |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent SetupsLot SizingschedulingMixed Integer Linear ProgrammingBranch-and-Bound algorithmABSTRACT In this paper, we deal with the Capacitated Lot Sizing and Scheduling Problem with sequence dependent setup times and costs - CLSD model. More specifically, we propose a simple reformulation for the CLSD model that enables us to define a new branching rule to be used in Branch-and-Bound (or Branch-and-Cut) algorithms to solve this NP-hard problem. Our branching rule can be easily implemented in commercial solvers. Computational tests performed in 240 test instances from the literature show that our approach can significantly reduce the running time to solve this problem using a Branch-and-Cut algorithm of a commercial MIP solver. Therefore, our approach can also improve the performance of other approaches that need to solve partial sub problems of the CLSD model in each iteration, such as Lagrangian approaches and heuristics based on the mathematical formulation of the problem.Sociedade Brasileira de Matemática Aplicada e Computacional2017-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512017000300515TEMA (São Carlos) v.18 n.3 2017reponame:TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online)instname:Sociedade Brasileira de Matemática Aplicada e Computacionalinstacron:SBMAC10.5540/tema.2017.018.03.0515info:eu-repo/semantics/openAccessOLIVEIRA,W.A. DESANTOS,M.O.eng2018-02-08T00:00:00Zoai:scielo:S2179-84512017000300515Revistahttp://www.scielo.br/temaPUBhttps://old.scielo.br/oai/scielo-oai.phpcastelo@icmc.usp.br2179-84511677-1966opendoar:2018-02-08T00:00TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) - Sociedade Brasileira de Matemática Aplicada e Computacionalfalse |
dc.title.none.fl_str_mv |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups |
title |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups |
spellingShingle |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups OLIVEIRA,W.A. DE Lot Sizing scheduling Mixed Integer Linear Programming Branch-and-Bound algorithm |
title_short |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups |
title_full |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups |
title_fullStr |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups |
title_full_unstemmed |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups |
title_sort |
A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups |
author |
OLIVEIRA,W.A. DE |
author_facet |
OLIVEIRA,W.A. DE SANTOS,M.O. |
author_role |
author |
author2 |
SANTOS,M.O. |
author2_role |
author |
dc.contributor.author.fl_str_mv |
OLIVEIRA,W.A. DE SANTOS,M.O. |
dc.subject.por.fl_str_mv |
Lot Sizing scheduling Mixed Integer Linear Programming Branch-and-Bound algorithm |
topic |
Lot Sizing scheduling Mixed Integer Linear Programming Branch-and-Bound algorithm |
description |
ABSTRACT In this paper, we deal with the Capacitated Lot Sizing and Scheduling Problem with sequence dependent setup times and costs - CLSD model. More specifically, we propose a simple reformulation for the CLSD model that enables us to define a new branching rule to be used in Branch-and-Bound (or Branch-and-Cut) algorithms to solve this NP-hard problem. Our branching rule can be easily implemented in commercial solvers. Computational tests performed in 240 test instances from the literature show that our approach can significantly reduce the running time to solve this problem using a Branch-and-Cut algorithm of a commercial MIP solver. Therefore, our approach can also improve the performance of other approaches that need to solve partial sub problems of the CLSD model in each iteration, such as Lagrangian approaches and heuristics based on the mathematical formulation of the problem. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-12-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=S2179-84512017000300515 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2179-84512017000300515 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.5540/tema.2017.018.03.0515 |
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 Matemática Aplicada e Computacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Matemática Aplicada e Computacional |
dc.source.none.fl_str_mv |
TEMA (São Carlos) v.18 n.3 2017 reponame:TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) instname:Sociedade Brasileira de Matemática Aplicada e Computacional instacron:SBMAC |
instname_str |
Sociedade Brasileira de Matemática Aplicada e Computacional |
instacron_str |
SBMAC |
institution |
SBMAC |
reponame_str |
TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) |
collection |
TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) |
repository.name.fl_str_mv |
TEMA (Sociedade Brasileira de Matemática Aplicada e Computacional. Online) - Sociedade Brasileira de Matemática Aplicada e Computacional |
repository.mail.fl_str_mv |
castelo@icmc.usp.br |
_version_ |
1752122220239388672 |