Implementação e teste de uma heurística de descida em vizinhança variável para um problema de programação de tarefas em máquinas paralelas

Abstract

In this work is presented a study on the unrelated parallel machine task scheduling with machine and sequence dependent setup times problem. This problem is of practical interest and occurs, for instance, in large facilities with production lines where machines are technologically different. The heuristic approach based in a variable neighborhood descent algorithm proposed by Fleszar et al. (2011) is implemented to solve this problem. Computational tests were performed considering the set of instances from Vallada and Ruiz (2011), besides the ones used in the original article. The results are compared in order to verify whether the method is in fact robust, efficient and effective as claimed by Fleszar et al. (2011).