Jorge M. S. Valente

Efficient heuristics for the weighted tardiness distributed permutation flowshop scheduling problem

The computational results show that a new approach for dealing with the last few jobs outperforms its traditional counterpart and the top positions in terms of solution quality were consistently occupied by the newly developed rules.