Minimizing Total Tardiness in the m-Machine Flow-Shop Problem by Heuristic Algorithms

In this work the m-machine permutation flow-shop problem has been considered. The permutation flow-shop scheduling problem where a set of jobs have to be scheduled on a set of machines in the same order. We propose  heuristic algorithms for the flow-shop problem to minimizing the total tardiness. A new genetic and Tabu search algorithm which initialized by the solution of EDD, NEH and EN algorithm. Computational experiments are performed on benchmark instances and the results show the good performances of these methods. Finally, some future research directions are given

A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem

This paper deals with the total completion time 2-machines flow shop problem. We present a so-called matheuristic post processing procedure that improves the objective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with O(n 2) variables and O(n) constraints