Uma abordagem heurística de busca local para problemas de sequenciamento da produção em máquinas paralelas com realease dates e tempos de setup.

Abstract

The growing competition among companies drives a continuous search for strategies that prioritize meeting customer expectations, thereby strengthening competitiveness in the market. The success of these strategies is directly related to the implementation of an efficient scheduling, which plays an essential role in reducing delivery times and optimizing resource utilization. This ensures not only customer satisfaction but also an increase in competitiveness within organizations. In light of this, the objective of this work is to propose a heuristic approach to optimize scheduling in the textile sector of a weaving company, aiming to minimize total the total tardiness. The studied scenario considers an environment composed of identical parallel machines with distinct release dates and sequence-dependent setup times. The developed heuristic employs local search and perturbation strategies to diversify the search space and find high-quality solutions. The algorithm was tested on eight instances, covering two different production lines over a four-month period. The results of applying the heuristic to various instances demonstrated the capability of this approach to generate efficient solutions, achieving an average reduction of total tardiness by 27.4%, while maintaining a low computational cost, ensuring high-quality solutions in less than two minutes.