Edmar Hell Kampke,  José Elias Cláudio Arroyo,  André Gustavo dos Santos. 

This work deals with the parallel machine scheduling problem with resource-assignable sequence dependent setup times. The goal of the problem is to minimize the total completion time and the total assignes resources. Due to the combinatorial complexity of this problem, it is proposed algorithms based on metaheuristics Reactive GRASP and Iterated Local Search (ILS). The obtained results for each metaheuristic are compared with the best results available in literature. The results show the good performance of the proposed algorithms.

http://www.lbd.dcc.ufmg.br/colecoes/enia/2011/0012.pdf

Processando consulta.