In this work the unrelated parallel machine scheduling problem with sequence dependent setup times is studied, the objective considered in this problem is the minimization of the maximum completion time of the schedule, also known as makespan. It is very relevant in a practical sense since it is largely found in the industrial scope, as well as in theoretical sense because it belongs to the NP-Hard class. Several algorithms were implemented in order to find good solutions for the UPMSP; the results obtained by them were compared, the VNS and the F&O heuristic with the VNS metaheuristic generating the initial solution presented the best results and in some instances, it found better results than the best-known results available.