Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Tardiness minimization in a flexible job shop: A tabu search approach
Author: Schrich, CR
Armentano, VA
Laguna, M
Abstract: 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.
Subject: scheduling
flexible job shop
due dates
tabu search
Country: Holanda
Editor: Kluwer Academic Publ
Citation: Journal Of Intelligent Manufacturing. Kluwer Academic Publ, v. 15, n. 1, n. 103, n. 115, 2004.
Rights: fechado
Date Issue: 2004
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000187535600008.pdf166.19 kBAdobe PDFView/Open

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