Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/53004
Type: Artigo de periódico
Title: A COMPOSITE HEURISTIC FOR THE IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM WITH MINIMUM MAKESPAN OBJECTIVE
Author: FRANCA, PM
GENDREAU, M
LAPORTE, G
MULLER, FM
Abstract: This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m identical parallel machines in order to minimize the makespan. The algorithm produces near-optimal solutions in short computation times. It outperforms alternative heuristics on a series of test problems.
Country: Inglaterra
Editor: Pergamon-elsevier Science Ltd
Rights: fechado
Identifier DOI: 10.1016/0305-0548(94)90053-1
Date Issue: 1994
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOSA1994MK14900009.pdf651.19 kBAdobe PDFView/Open


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