Uma nova heurística para o problema de minimiza？？o de trocas de ferramentas

the minimization of tool switches problem (mtsp) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. this study presents a new heuristic for the mtsp. this heuristic has two phases: a constructive phase, based on a graph where the vertices correspond to tools and there is an arc k = (i, j) linking vertices i and j if and only if the tools i and j are required to execute some job; and an improvement phase, based on an iterated local search. computational results show that the proposed heuristic has a good performance on the instances tested contributing to a significant reduction in the number of nodes generated by an enumerative algorithm.