Soluções de alto desempenho para a programação da produção flow shop

In this article we consider the permutational flow shop scheduling problem. A new constructive heuristic method is presented with the objective of minimizing makespan and it is compared with the best constructive heuristic methods reported in literature (NEH and NEHKK). Experiment results show that the new heuristic method provides high quality solutions in comparision with the evaluated methods for the set of Taillard test problems. Keywords: Scheduling, permutation flow shop, heuristic method.