Avaliação de métodos de otimização para o flowshop permutacional com bloqueio e critério de total tardiness

Abstract

With the various technological advances and the increasing demand for products, optimizing production systems has become increasingly necessary to maintain competitiveness and meet consumer needs. In an effort to contribute to this optimization process, tools that support these processes have become essential. One such tool is scheduling, which can help maximize resource utilization and reduce costs. This study aims to explore and evaluate heuristic optimization methods for the flow shop scheduling problem with blocking constraints and a total tardiness criterion, which is known to be NP-Hard for m ≥ 2. The literature on this type of problem is scarce; therefore, this work seeks to fill this gap. To assess the performance of the heuristics, an initial solution is used to establish an Upper bound, which is applied in a branch and bound algorithm.