Otimização do makespan em um problema flowshop permutacional distribuído em células utilizando métodos heurísticos

Abstract

The increasing decentralization of industries around the world has spread the study of distributed permutational sequencing (DPFSP),where there is greater complexity in relation to a permutational flowshop problem (PFSP), and this is due to the fact that there is one more variable, the plant to be used, with the same number of machines. This new plant distribution has been used for being more advantageous in minimizing process costs, improving management and ensuring superior quality. For the present study, it was developed, through computational experiments, the analysis between four different heuristics (A, B, C and D), derived from others already existing in the literature, mainly NEH and a fifth (C2), the result of a alternative to the heuristic with the best performance compared to the others, in this case the C. Performance criteria were minimization of the total programming duration (makespan) and the processing time of the four proposed heuristics. The study revealed the superiority of the C heuristic in the proposed experimental field, with a lower makespan value, high success rate and low deviation, thus ensuring its efficiency, all without neglecting a viable machine processing time.