Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/4666
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSeeanner,Fen
dc.contributor.authorBernardo Almada-Loboen
dc.contributor.authorMeyr,Hen
dc.date.accessioned2017-12-21T14:33:11Z-
dc.date.available2017-12-21T14:33:11Z-
dc.date.issued2013en
dc.identifier.urihttp://repositorio.inesctec.pt/handle/123456789/4666-
dc.identifier.urihttp://dx.doi.org/10.1016/j.cor.2012.07.002en
dc.description.abstractIn 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.en
dc.languageengen
dc.relation5428en
dc.rightsinfo:eu-repo/semantics/embargoedAccessen
dc.titleCombining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problemsen
dc.typearticleen
dc.typePublicationen
Appears in Collections:CEGI - Other Publications

Files in This Item:
File Description SizeFormat 
P-008-NN4.pdf
  Restricted Access
401.75 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.