Novos algoritmos para linhas de montagem flowshop com tempo de setup

Abstract

The production environment flowshop with setup time, which has the criterion of minimizing the makespan, has been gaining attention from researchers in the area of production and combinatorial optimization. With the increase of their research, the performance of their algorithmic approaches has been rapidly raised. In this work we present new methods for the scheduling problem in the flowshop production environment with machine setup times, separated from task processing times. The new methods are heuristic, of type Variable Neighborhood Searches (VNS) and their variation Variable Neighborhood Descent (VND)