%0 Journal Article
%T Uma nova heur¨ªstica para o problema de minimiza£¿£¿o de trocas de ferramentas
%A Chaves
%A Ant£¿nio Augusto
%A Senne
%A Edson Luiz Fran£¿a
%A Yanasse
%A Horacio Hideki
%J Gest£¿o & Produ£¿£¿o
%D 2012
%I Universidade Federal de S?o Carlos
%R 10.1590/S0104-530X2012000100002
%X 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.
%K scheduling
%K tool switches
%K heuristic
%K graph
%K metaheuristic.
%U http://www.scielo.br/scielo.php?script=sci_abstract&pid=S0104-530X2012000100002&lng=en&nrm=iso&tlng=en