Um Algoritmo evolucionário aplicado ao problema flowshop permutacional com restrição de espera

Abstract

This work approaches a resolution technique for the Continuous Permutation Flowshop Scheduling Problem (CPFSP) without wait for processing among consecutive machines. Two types of CPFSP were resolved. One with the function objective being the total time of flow and the another being the makespan. The resolution technique is based on the metaheurística Genetic Algorithm (AG) that has been applied with success to the problems of the class Permutation Flowshop Scheduling Problem (PFSP). AG didn't use initialization efficient and/ou hibridization, with a search technique. Criterias were adopted for the diversification and intensification in the search for good solutions of the problem. Several experiments computacionais were accomplished and compared with other methods found in the literature, where it was possible to verify the good acting of the developed method.