-
Diego Gomes Coelho
Programa de Pós-Graduação em Instrumentação, Controle e Automação de Processos de Mineração, Universidade Federal de Ouro Preto e Instituto Tecnológico Vale, MG
-
Luciano Perdigão Cota
Instituto Tecnológico Vale, MG
-
Marcone Jamilson Freitas Souza
Departamento de Computação, Universidade Federal de Ouro Preto, MG
Keywords:
Long-term maintenance scheduling problem, Combinatorial optimization, constructive heuristics
Abstract
In this work, we study the applications of constructive heuristic and job positioning algorithms for a long-term maintenance scheduling problem. This problem is complex, where it is necessary to schedule preventive maintenance orders for the available work teams for a time horizon. Up to date, constructive heuristic and job positioning algorithms have not been explored in the literature for this problem. This study proposes a method that can generate a set of constructive algorithms based on several construction rules and returns the best of them for each instance. We use large instances to evaluate the proposed method. In addition, we compare its results with those of meta-heuristic algorithms from the literature. The proposed method demanded much less computational time. Moreover, it found the best result in 49% of the instances, including the largest with more than 33,000 jobs.
