Investigação de heurísticas para o problema de programação de tarefas em máquinas em um ambiente flowshop com restrição no-wait

Abstract

The evolution which production systems had in a short time, can prove its dynamics, and realize that a lot of industries still have opportunities of improvement in the use of their resources. One of techniques employed in the optimization of resources is heuristic, because they help in the solution of complex problems, as in the case of the definition of the production sequencing in industry. As a first step to propose improvements in production environment we first must make some investigations and experiments, therefore this work acts. On this initial stage with an investigation of heuristics SPT (Shortest Processing Time), LPT (Longest Processing Time), Triangular, Triangular Invertida e Randômica with the purpose of showing the best results for objective function which groups total processing time - makespan and total time of working tasks - flowtime, for a flowshop environment with no-wait restriction.