Algorithms for the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times

This work addresses the Unrelated Parallel Machines Scheduling Problem with Sequence-Dependent Setup Times - UPMSPST. The objective considered here is to minimize the scheduling maximum completion time, also known as makespan. This is important in the practical sense as the UPMSPST is widely found in industries. As well, in a theoretical sense, it belongs to the NP-Hard class. Five algorithms have been implemented to find solutions for the UPMSPST. The results obtained by the execution of these algorithms were compared. Among all the algorithms studied here, the VNS and F&O heuristic with the VNS metaheuristic generating the initial solution presented the best results. In some cases, it even presented better results than in [1].