Services on Demand
- Cited by Google
- Similars in SciELO
- Similars in Google
Gestão & Produção
Print version ISSN 0104-530X
CHAVES, Antônio Augusto; SENNE, Edson Luiz França and YANASSE, Horacio Hideki. A new heuristic for the minimization of tool switches problem. Gest. Prod. [online]. 2012, vol.19, n.1, pp.17-30. ISSN 0104-530X. http://dx.doi.org/10.1590/S0104-530X2012000100002.
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.
Keywords : Scheduling; Tool switches; Heuristic; Graph; Metaheuristic.