Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems

Detalhes bibliográficos
Autor(a) principal: Seeanner,F
Data de Publicação: 2013
Outros Autores: Bernardo Almada-Lobo, Meyr,H
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://repositorio.inesctec.pt/handle/123456789/4666
http://dx.doi.org/10.1016/j.cor.2012.07.002
Resumo: In this paper a new heuristic is proposed to solve general multi-level lot-sizing and scheduling problems. The idea is to cross-fertilize the principles of the meta-heuristic Variable Neighborhood Decomposition Search (VNDS) with those of the MIP-based Fix&Optimize heuristic. This combination will make it possible to solve the kind of problems that typically arise in the consumer goods industry due to sequence-dependent setups and shifting bottlenecks. In order to demonstrate the strength of this procedure, a GLSP variant for multiple production stages is chosen as a representative. With the help of artificial and real-world instances, the quality of the solution as well as the computational performance of the new procedure is tested and compared to a standard MIP-solver.
id RCAP_87c93f56cca26946b464c67b5610a80e
oai_identifier_str oai:repositorio.inesctec.pt:123456789/4666
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problemsIn this paper a new heuristic is proposed to solve general multi-level lot-sizing and scheduling problems. The idea is to cross-fertilize the principles of the meta-heuristic Variable Neighborhood Decomposition Search (VNDS) with those of the MIP-based Fix&Optimize heuristic. This combination will make it possible to solve the kind of problems that typically arise in the consumer goods industry due to sequence-dependent setups and shifting bottlenecks. In order to demonstrate the strength of this procedure, a GLSP variant for multiple production stages is chosen as a representative. With the help of artificial and real-world instances, the quality of the solution as well as the computational performance of the new procedure is tested and compared to a standard MIP-solver.2017-12-21T14:33:11Z2013-01-01T00:00:00Z2013info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/4666http://dx.doi.org/10.1016/j.cor.2012.07.002engSeeanner,FBernardo Almada-LoboMeyr,Hinfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:20:47Zoai:repositorio.inesctec.pt:123456789/4666Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:53:37.611945Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
title Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
spellingShingle Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
Seeanner,F
title_short Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
title_full Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
title_fullStr Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
title_full_unstemmed Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
title_sort Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
author Seeanner,F
author_facet Seeanner,F
Bernardo Almada-Lobo
Meyr,H
author_role author
author2 Bernardo Almada-Lobo
Meyr,H
author2_role author
author
dc.contributor.author.fl_str_mv Seeanner,F
Bernardo Almada-Lobo
Meyr,H
description In this paper a new heuristic is proposed to solve general multi-level lot-sizing and scheduling problems. The idea is to cross-fertilize the principles of the meta-heuristic Variable Neighborhood Decomposition Search (VNDS) with those of the MIP-based Fix&Optimize heuristic. This combination will make it possible to solve the kind of problems that typically arise in the consumer goods industry due to sequence-dependent setups and shifting bottlenecks. In order to demonstrate the strength of this procedure, a GLSP variant for multiple production stages is chosen as a representative. With the help of artificial and real-world instances, the quality of the solution as well as the computational performance of the new procedure is tested and compared to a standard MIP-solver.
publishDate 2013
dc.date.none.fl_str_mv 2013-01-01T00:00:00Z
2013
2017-12-21T14:33:11Z
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://repositorio.inesctec.pt/handle/123456789/4666
http://dx.doi.org/10.1016/j.cor.2012.07.002
url http://repositorio.inesctec.pt/handle/123456789/4666
http://dx.doi.org/10.1016/j.cor.2012.07.002
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/embargoedAccess
eu_rights_str_mv embargoedAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799131610470154240

Registros relacionados