Estudo comparativo de métodos heurísticos para o problema no-wait flowshop permutacional na minimização do tempo total da programação e tempo total de fluxo

Abstract

Industrial processes need an efficient scheduling. This work consists in the allocation of productive resources, with a view to execute a certain amount of tasks in a defined period of time. There are different kinds of resources to be administrated and also, the amount of possible solutions increases rapidly with the rise of the amount of tasks and machines presented in the system, what makes the production programation task one of the most complex activities in the production planning. The goal of this work is to find the best heuristic method to be used to minimize the total processing time (makespan) and total time of working tasks (flowtime). For this, heuristic methods will be analysed in order to solve the production programation problem in No-Wait Flowshop environment. The computational trial will show the best heuristic method to be used for the resolution of this problem.