Heurística GRASP para la minimización del makespan en máquinas paralelas no relacionadas con tiempos de preparación dependientes de la secuencia

Abstract

A GRASP (Greedy Randomized Adaptive Search Procedures) algorithm to solve the unrelated parallel machines scheduling problem with sequence dependent setup times and makespan minimization is proposed. Four neighborhoods in the local search phase of the GRASP algorithm using a sequence and matrix representation of solutions, are proposed. The effectiveness and efficiency of the proposed heuristics are compared on a benchmark problem dataset with other metaheuristics of the literature used in earlier studies. One of the proposed heuristics outperforms the average makespan.