Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date

Abstract

In this paper, metaheuristic approaches for the weighted late work minimization in the two-machine flow shop problem with a common due date (F2 | dj=d | Yw) are presented. The late work performance measure estimates the quality of a solution with regard to the duration of the late parts of jobs not taking into account the quantity of the delay for the fully late activities. Since, the problem mentioned is known to be NP-hard, three trajectory based methods, namely simulated annealing, tabu search and variable neighborhood search were designed and compared to an exact approach and a list scheduling algorithm.