Algoritmo metaheurístico para busca do gargalo flutuante em flow shop permutacional com tempos de setup assimétricos e dependentes da seqüência

Abstract

It treats ofthe development ofa metaheuristíc algorithm for permutational flow shop with asymmetric sequence dependent setup times (ASDSTr), with focus in the main restriction to the output ofa defíned production system: the bottleneck. The developed algorithm, called "Metaheuristic Algorithm of Search of the Flotation Bottleneck in Simulated Annealing {BGaFSAy\ Ít hás as acting criterion the optimization of the makespan (Cmax.) and it analyzes a possible change of the bottleneck in the system due to the local optimization of the bottleneck initially identífíed. Starting from the development of a software, the comparative was analyzed with other algorithm well referenced in the líterature and also the individual behavior of BGaFSA. The computational experimentation demonstrates that the simple local optimization ofthe bottleneck cannot be enough for the obtaining ofthe best global result, and that the flotation of the bottleneck happens and it should be consider for the obtaining ofa global great solution to the problem. That contradicts part of the researches in ASDST with bottleneck that it considers the local optimization ofthe bottleneck as the best road for the optimization ofthe complete system.