Análise de métodos heurísticos para o problema clássico flow shop com múltiplas células

Abstract

Production processes, in any context, require careful planning to ensure efficient production scheduling. This is because such planning enables companies to reduce costs, optimize their production efficiency and strengthen their reliability in meeting deadlines. One of the approaches that support organizations in defining the production sequence are heuristic methods. The purpose of this study is to investigate the performance of these methods in terms of the best results for makespan and flowtime, with the aim of identifying those that perform best in the context of flow shop problems. To this end, the Data Generator software was used to create 5,000 data sets, allowing the performance of constructive heuristic methods to be evaluated. This analysis was conducted using a Pascal programming code, resulting in 20,000 examined solutions. The results showed that the SPT heuristic with two identical cells achieved the best results, with 100% success and 0% relative deviation in both classes.