Um algoritmo ILS–RVND para o problema de escalonamento do tipo flow shop de permutação com tempo de conclusão total como medida de desempenho

Abstract

This work presents FILS, a new ILS–RVND heuristic for the flow shop scheduling problem with total completion time as optimality criterion, which produced 55 best minimum values for a set of 90 reference instances presented for the problem in question. In this study, four different parameterizations for using the approach are examined through computational experiments, using the benchmark problems from Taillard (1993), demonstrating that the proposed approach is a robust and effective solution. FILS was compared to algorithms such as VNS, hDDE, DABC, HGLS, VNS4, AGA and V4AGA, where the results indicate that FILS is superior in most cases.