Avaliação de métodos heurísticos para problemas flowshop permutacional distribuído com minimização do tempo total de fluxo e duração total da programação

Abstract

The rising demand for products and services forces companies to optimize continuously their production systems in order to maintain competitivity and satisfy the market necessities. One of the tools that helps this optimization process is scheduling, which is capable of bringing benefits to the company through cost and waste reduction and resource use maximization. It is valid, indeed, the implementation of heuristic methods to obtain feasible solutions for job scheduling problems. This paper aims to consolidate a theoretical base for scheduling concepts, implement the LPT and SPT heuristics already known in literature for the distributed flowshop problem through computational experimentation and propose variations of the heuristics to analyse the overall performance in minimization of the proposed objective functions makespan and flow time. As result of the computational experimentation, a similar performance for the heuristics chosen for this paper in terms of makespan minimization, and SPT heuristic method superiority in terms of flow time minimization.