Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/79004
Type: Artigo de periódico
Title: Tabu search for minimizing total tardiness in a job shop
Author: Armentano, VA
Scrich, CR
Abstract: This paper presents a tabu search approach to minimize total tardiness for the job shop scheduling problem. The method uses dispatching rules to obtain an initial solution and searches for new solutions in a neighborhood based on the critical paths of the jobs. Diversification and intensification strategies are suggested. For small problems the solutions' quality is evaluated against optimal solution values and for large problems the tabu search performance is compared with two heuristics proposed in the literature. (C) 2000 Elsevier Science B.V. All rights reserved.
Subject: scheduling
job shop
due dates
heuristic
tabu search
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Date Issue: 2000
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000084223900002.pdf169.52 kBAdobe PDFView/Open


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