Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem

Abstract

This paper investigates permutation flow shop scheduling problems with sequence-dependent setup times with minimizing the number of tardy jobs as criterion (Fm|prmu, Sijk|∑Uj). Since the proposed research problem has been proven to be NP-hard, three different meta heuristic algorithms based on tabu search (TS) has been proposed to solve the problem. These three algorithms are different based on their tabu list characteristics. In order to evaluate the performance of the proposed TS algorithms, test problems in different ranges are generated to find the best algorithm. The comparison shows that the TS algorithm which its tabu list keeps track of the slots that the jobs are assigned has a better performance than the other algorithms