Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/94289
Author(s): Ross J. W. James
Bernardo Almada-Lobo
Title: Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics
Issue Date: 2011
Abstract: We propose a general-purpose heuristic approach combining metaheuristics and mixed integer programming to find high quality solutions to the challenging single- and parallel-machine capacitated lotsizing and scheduling problem with sequence-dependent setup times and costs. Commercial solvers fail to solve even medium-sized instances of this NP-hard problem; therefore, heuristics are required to find competitive solutions. We develop construction, improvement and search heuristics all based on MIP formulations. We then compare the performance of these heuristics with those of two metaheuristics and other MIP-based heuristics that have been proposed in the literature, and to a state-of-the-art commercial solver. A comprehensive set of computational experiments shows the effectiveness and efficiency of the main approach, a stochastic MIP-based local search heuristic, in solving medium to large size problems. Our solution procedures are quite flexible and may easily be adapted to cope with model extensions or to address different optimization problems that arise in practice. (C) 2011 Elsevier Ltd. All rights reserved.
URI: https://repositorio-aberto.up.pt/handle/10216/94289
Document Type: Artigo em Revista Científica Internacional
Rights: restrictedAccess
Appears in Collections:FEUP - Artigo em Revista Científica Internacional

Files in This Item:
File Description SizeFormat 
59919.pdf
  Restricted Access
235.54 kBAdobe PDF    Request a copy from the Author(s)


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