Comparativo de desempenho entre os sistemas de produção clássico e com restrição no-wait no ambiente flow shop permutacional em uma função bi-objetivo

Abstract

This paper is directed to the Permutation Flow Shop Scheduling problem. Scheduling program in industries requires techniques for solving complex problems and often imposes constraints. The study aims to develop evaluations for heuristics with the objective of minimizing a bi-criterion function for mean flowtime and makespan, which have direct influence on productive system by reducing stock process, increasing reliability of delivery times, rationalizing the use of production line and, among others. The LPT (Longest Process Time), SPT (Shortest Process Time), Triangular and Inverted Triangular methods are compared among their solutions in a classical environment and in no-wait one. The results of the computational experimentation show the increase in percentage of the objective function as the complexity of the problems increases, when comparing classical environment and no-wait. As a result, the recommended heuristic showing less loss in the application of the non-wait restriction was triangular; and the worst heuristic was inverted triangular.