Matheuristic algorithms for minimizing total tardiness in the m -machine flow-shop scheduling problem

We consider in this paper the m-machine permutation flow-shop problem with total tardiness minimization. we propose several matheuristic algorithms, which are an hybridization of a local search and an exact resolution method. the matheuristics are compared to a genetic algorithm. computational experiments are performed on benchmark instances and the results show the good performances of the matheuristic algorithms. finally, some future research directions are given.