An analysis of formulations for the capacitated lot sizing problem with setup crossover
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1016/j.cie.2016.12.037 http://hdl.handle.net/11449/162632 |
Resumo: | The lot sizing problem with setup crossover is an extension of the standard big bucket capacitated lot sizing problem (CLSP). The general idea is that the first setup operation of each planning period can already start in the previous period, if not all the capacity is used in that previous period. This provides more flexibility in the planning and increases the possibility of finding feasible and better solutions compared to the standard assumption. Two different formulations have been presented in the literature to model a setup crossover. Since these formulations have not been compared directly to each other, we present a computational study to determine which is the best formulation. Furthermore, we explore ideas indicating that in one of the formulations from the literature it is not necessary to impose binary conditions on the crossover variables and we propose symmetry breaking constraints for both formulations from the literature. Finally, we quantify the value of this type of flexibility in a computational experiment and analyze which factors influence this value. (C) 2016 Published by Elsevier Ltd. |
id |
UNSP_113ffa9bfad08534fb69ce496fd80fcd |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/162632 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
An analysis of formulations for the capacitated lot sizing problem with setup crossoverProductionMathematical formulationsLot sizingSetup crossoverSymmetry breakingThe lot sizing problem with setup crossover is an extension of the standard big bucket capacitated lot sizing problem (CLSP). The general idea is that the first setup operation of each planning period can already start in the previous period, if not all the capacity is used in that previous period. This provides more flexibility in the planning and increases the possibility of finding feasible and better solutions compared to the standard assumption. Two different formulations have been presented in the literature to model a setup crossover. Since these formulations have not been compared directly to each other, we present a computational study to determine which is the best formulation. Furthermore, we explore ideas indicating that in one of the formulations from the literature it is not necessary to impose binary conditions on the crossover variables and we propose symmetry breaking constraints for both formulations from the literature. Finally, we quantify the value of this type of flexibility in a computational experiment and analyze which factors influence this value. (C) 2016 Published by Elsevier Ltd.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Natural Sciences and Engineering Research Council of CanadaUniv Estadual Paulista, Dept Matemat Aplicada, BR-15054000 Sao Jose Do Rio Preto, SP, BrazilHEC Montreal, Montreal, PQ H3T 2A7, CanadaCIRRELT, Montreal, PQ H3T 2A7, CanadaUniv Estadual Paulista, Dept Matemat Aplicada, BR-15054000 Sao Jose Do Rio Preto, SP, BrazilFAPESP: 2010/16727-9FAPESP: 2013/00965-6FAPESP: 2014/01203-5Natural Sciences and Engineering Research Council of Canada: 371966-2009Elsevier B.V.Universidade Estadual Paulista (Unesp)HEC MontrealCIRRELTFiorotto, Diego Jacinto [UNESP]Jans, RafAraujo, Silvio Alexandre de [UNESP]2018-11-26T17:24:13Z2018-11-26T17:24:13Z2017-04-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article338-350application/pdfhttp://dx.doi.org/10.1016/j.cie.2016.12.037Computers & Industrial Engineering. Oxford: Pergamon-elsevier Science Ltd, v. 106, p. 338-350, 2017.0360-8352http://hdl.handle.net/11449/16263210.1016/j.cie.2016.12.037WOS:000397820300024WOS000397820300024.pdfWeb of Sciencereponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengComputers & Industrial Engineering1,463info:eu-repo/semantics/openAccess2023-12-01T06:17:03Zoai:repositorio.unesp.br:11449/162632Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T19:14:39.142492Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
An analysis of formulations for the capacitated lot sizing problem with setup crossover |
title |
An analysis of formulations for the capacitated lot sizing problem with setup crossover |
spellingShingle |
An analysis of formulations for the capacitated lot sizing problem with setup crossover Fiorotto, Diego Jacinto [UNESP] Production Mathematical formulations Lot sizing Setup crossover Symmetry breaking |
title_short |
An analysis of formulations for the capacitated lot sizing problem with setup crossover |
title_full |
An analysis of formulations for the capacitated lot sizing problem with setup crossover |
title_fullStr |
An analysis of formulations for the capacitated lot sizing problem with setup crossover |
title_full_unstemmed |
An analysis of formulations for the capacitated lot sizing problem with setup crossover |
title_sort |
An analysis of formulations for the capacitated lot sizing problem with setup crossover |
author |
Fiorotto, Diego Jacinto [UNESP] |
author_facet |
Fiorotto, Diego Jacinto [UNESP] Jans, Raf Araujo, Silvio Alexandre de [UNESP] |
author_role |
author |
author2 |
Jans, Raf Araujo, Silvio Alexandre de [UNESP] |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) HEC Montreal CIRRELT |
dc.contributor.author.fl_str_mv |
Fiorotto, Diego Jacinto [UNESP] Jans, Raf Araujo, Silvio Alexandre de [UNESP] |
dc.subject.por.fl_str_mv |
Production Mathematical formulations Lot sizing Setup crossover Symmetry breaking |
topic |
Production Mathematical formulations Lot sizing Setup crossover Symmetry breaking |
description |
The lot sizing problem with setup crossover is an extension of the standard big bucket capacitated lot sizing problem (CLSP). The general idea is that the first setup operation of each planning period can already start in the previous period, if not all the capacity is used in that previous period. This provides more flexibility in the planning and increases the possibility of finding feasible and better solutions compared to the standard assumption. Two different formulations have been presented in the literature to model a setup crossover. Since these formulations have not been compared directly to each other, we present a computational study to determine which is the best formulation. Furthermore, we explore ideas indicating that in one of the formulations from the literature it is not necessary to impose binary conditions on the crossover variables and we propose symmetry breaking constraints for both formulations from the literature. Finally, we quantify the value of this type of flexibility in a computational experiment and analyze which factors influence this value. (C) 2016 Published by Elsevier Ltd. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-04-01 2018-11-26T17:24:13Z 2018-11-26T17:24:13Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1016/j.cie.2016.12.037 Computers & Industrial Engineering. Oxford: Pergamon-elsevier Science Ltd, v. 106, p. 338-350, 2017. 0360-8352 http://hdl.handle.net/11449/162632 10.1016/j.cie.2016.12.037 WOS:000397820300024 WOS000397820300024.pdf |
url |
http://dx.doi.org/10.1016/j.cie.2016.12.037 http://hdl.handle.net/11449/162632 |
identifier_str_mv |
Computers & Industrial Engineering. Oxford: Pergamon-elsevier Science Ltd, v. 106, p. 338-350, 2017. 0360-8352 10.1016/j.cie.2016.12.037 WOS:000397820300024 WOS000397820300024.pdf |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Computers & Industrial Engineering 1,463 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
338-350 application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier B.V. |
publisher.none.fl_str_mv |
Elsevier B.V. |
dc.source.none.fl_str_mv |
Web of Science reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129039533080576 |