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

• Type: Article in International Scientific Journal
• Date: 2010

Authors

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

Journal

Title: International Journal of Production Research

Vol. 48 No. 3

Pages: 861-878

ISSN: 0020-7543

Publisher: Taylor & Francis

Indexing

ISI Web of Knowledge - 27 Citations

ISI Web of Science

Scopus - 34 Citations

COMPENDEX

INSPEC

Scientific classification

FOS: Engineering and technology

Other information

Authenticus ID: 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.

Language: English

Type (Professor's evaluation): Scientific