Minimización de la tardanza para el flowshop flexible con setup utilizando heurísticas constructivas y un algoritmo genético

this paper studied the problem of sequencing n jobs in a k-stages flexible flowshop with different number of parallel machines per stage with anticipatory sequence dependent setup times (sdst) and tardiness minimization. the performance of constructive heuristics and the genetic algorithm are compared. the evaluation of the methods is made experimentally over a set of randomly generated test problems. the results indicate that the genetic algorithm do not outperforms all of the compared heuristics.