Please use this identifier to cite or link to this item:
Author(s): Bernardo Almada-Lobo
Ross J. W. James
Title: Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
Issue Date: 2010
Abstract: We address a problem that often arises in industry, the multi-item capacitated-lot-sizing and scheduling problem with sequence-dependent setup times and costs. Powerful commercial solvers fail to solve even medium-sized instances of this NP-hard problem, therefore we employ a tabu search and a variable neighbourhood search meta-heuristic to solve it and compare the performance of these metaheuristics over time. In contrast to the majority of the literature on this topic, the solution representation explicitly considers production quantities and setup variables, which enables us to develop fast search heuristics. A comprehensive set of computational experiments shows the effectiveness and efficiency of the proposed approaches in solving medium-to large-sized problems.
Subject: Ciências da engenharia e tecnologias
Engineering and technology
Document Type: Artigo em Revista Científica Internacional
Rights: restrictedAccess
Appears in Collections:FEUP - Artigo em Revista Científica Internacional
FADEUP - Artigo em Revista Científica Internacional

Files in This Item:
File Description SizeFormat 
56551.pdf232.33 kBAdobe PDF    Request a copy

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