Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups

• Tipo: Artigo em Revista Científica Internacional
• Data: 2010

Autores

Bernardo Almada-Lobo (Autor) FEUP; Ross J. W. James (Autor) FADEUP

Revista

Título: International Journal of Production Research

Vol. 48 Nº 3

Páginas: 861-878

ISSN: 0020-7543

Editora: Taylor & Francis

Indexação

ISI Web of Knowledge - 33 Citações

ISI Web of Science

Scopus - 40 Citações

COMPENDEX

INSPEC

Classificação Científica

FOS: Ciências da engenharia e tecnologias

Outras Informações

ID Authenticus: P-003-BE0

DOI: 10.1080/00207540802446787

Abstract (EN): 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica