Artículos de revistas
Tardiness minimization in a flexible job shop: A tabu search approach
Registro en:
Journal Of Intelligent Manufacturing. Kluwer Academic Publ, v. 15, n. 1, n. 103, n. 115, 2004.
0956-5515
WOS:000187535600008
Autor
Schrich, CR
Armentano, VA
Laguna, M
Institución
Resumen
This paper addresses the problem of scheduling jobs in a flexible job shop with the objective of minimizing total tardiness. The flexible job shop differs from the classical job shop in that each of the operations associated with a job can be processed on any of a set of alternative machines. Two heuristics based on tabu search are developed for this problem: a hierarchical procedure and a multiple start procedure. The procedures use dispatching rules to obtain an initial solution and then search for improved solutions in neighborhoods generated by the critical paths of the jobs in a disjunctive graph representation. Diversification strategies are also implemented and tested. The outcomes of extensive computational results are reported. 15 1 103 115