Resumo

SALAZAR-HORNIG, Eduardo  e  SOTO-GAVILAN, Gina. Makespan Minimization on Unrelated Parallel Machines Scheduling Problem with Sequence Dependent Setup Times by a VNS/ACO Hybrid Algorithm. Rev. ing. univ. Medellín [online]. 2021, vol.20, n.38, pp.171-184.  Epub 28-Nov-2021. ISSN 1692-3324.  https://doi.org/10.22395/rium.v20n38a11.

This paper proposes a hybrid heuristic that combines Variable Neighborhood Search (VNS) with Ant Colony Optimization (ACO) to solve the scheduling problem of nonrelated parallel machines with sequence dependent setup times in order to minimize the makespan. The Variable Neighborhood Search is proposed to solve the scheduling problem with a descending scheme in a first phase, with an ACO algorithm, which successively reorder the jobs in the machine with the largest makespan in a second phase. An experimental study was performed using test problems from the literature showing that the second phase of the algorithm improves the solution obtained in the first phase. The results obtained are also compared with other methods in the literature proving to be a competitive method.

Palavras-chave : makespan; non related parallel machines; setup; metaheuristic; VNS; ACO.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )