A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness

This study considers the problem of scheduling independent jobs on unrelated parallel machines with machine- and sequence-dependent setup times for the objective of minimizing the total tardiness, i.e., R (m) a,S (ijk) a,aT (j) . Since the parallel machines are unrelated, sequence-dependent setup times must depend on machines. To the best of the authors' knowledge, the simulated annealing and the iterated greedy algorithms are two existing ones for the new class of scheduling problem with an additional constraint of strict due date constraints for some jobs, i.e., deadlines. In this study, we suggest a tabu search algorithm that incorporates various neighborhood generation methods. A computational experiment was done on the instances generated by the method used in the two previous research articles, and the results show that the tabu search algorithm outperforms the simulated annealing algorithm significantly. In particular, it gave optimal solutions for more than 50 % of small-sized test instances. Also, an additional test was done to compare the performances of the tabu search and the existing iterated greedy algorithms, and the result shows that the tabu search algorithm gives quicker solutions than the iterated greedy algorithm although it gives less quality solutions.