Resolution of the F2||Σtj scheduling problem by genetic algorithm and matheuristic

We consider in this paper the two-machine flow-shop scheduling problem with total tardiness minimization. We propose a genetic algorithm and a matheuristic algorithm. Some computational experiments are described and the results show that these methods outperform other existing methods based on truncated branch-and-bound algorithms. Some future research directions are given, both in terms of evaluation and of resolution method.