Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/79006
Type: Artigo de periódico
Title: Tabu search for total tardiness minimization in flowshop scheduling problems
Author: Armentano, VA
Ronconi, DP
Abstract: This work addresses the permutation flowshop scheduling problem with the objective of minimizing total tardiness. First, the behavior of solutions for small problems is analyzed for different due date scenarios. Then a tabu search-based heuristic is proposed as a method to explore the solution space. Diversification, intensification, and neighborhood restriction strategies are evaluated. Computational tests are presented and comparisons with the NEH algorithm and with a Branch-and-Bound algorithm are made. (C) 1998 Elsevier Science Ltd. All rights reserved.
Subject: flowshop scheduling
total tardiness
tabu search
Country: Inglaterra
Editor: Pergamon-elsevier Science Ltd
Rights: fechado
Identifier DOI: 10.1016/S0305-0548(98)00060-4
Date Issue: 1999
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000077015700003.pdf267.84 kBAdobe PDFView/Open


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