Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/53879
Type: Artigo de periódico
Title: A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
Author: Franca, PM
Gendreau, M
Laporte, G
Muller, FM
Abstract: This article deals with the problem of scheduling n jobs on m identical parallel processors with the objective of minimizing the total execution time (makespan). A new three-phase heuristic s proposed for solving this problem. An initial phase constructs a starting solution which is improved, in a second phase, by means of a tabu search method. A final phase follows attempting a further improvement in the current solution. Numerical rests in a series of randomly generated problems indicate that the proposed method outperforms a previous heuristic, Comparisons with an exact procedure attest that our method produces good-quality solutions in reasonable running times.
Subject: multiprocessor scheduling
local search
tabu search
heuristics
Country: Holanda
Editor: Elsevier Science Bv
Rights: fechado
Identifier DOI: 10.1016/0925-5273(96)00031-X
Date Issue: 1996
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOSA1996VG24100001.pdf960.67 kBAdobe PDFView/Open


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