Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Tabu search for total tardiness minimization in flowshop scheduling problems|
|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.|
|Editor:||Pergamon-elsevier Science Ltd|
|Citation:||Computers & Operations Research. Pergamon-elsevier Science Ltd, v. 26, n. 3, n. 219, n. 235, 1999.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.