COVERT Based Algorithms for Solving the Generalized Tardiness Flow Shop Problems

Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. we consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. we modify the concept of cost over time(covert) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms. the efficiency of the developed algorithms is then tested through extensive computational experiments and the results will be presented.