Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Tabu search for minimizing total tardiness in a job shop|
|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.|
|Editor:||Elsevier Science Bv|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.