Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Comparing meta-heuristic approaches for parallel machine scheduling problems
Author: Mendes, AS
Muller, FM
Franca, PM
Moscato, P
Abstract: The aim of this paper is to compare the performance of two meta-heuristic methods proposed to solve the identical parallel machine scheduling problem with sequence dependent setup times. The goal is to minimize the makespan. The first algorithm is a tabu search based heuristic and the second a memetic approach, which combines a population-based method with local search procedures. As benchmarks for small-sized instances, optimal and lower bound values are used provided by a dichotomous search. For larger instances, the comparisons rely on the best known solutions provided by an exhaustive search variant of the tabu procedure.
Subject: machine scheduling
parallel machines
tabu search
memetic algorithms
Country: Inglaterra
Editor: Taylor & Francis Ltd
Rights: fechado
Identifier DOI: 10.1080/09537280110069649
Date Issue: 2002
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000173497700005.pdf87.09 kBAdobe PDFView/Open

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