Jul 24, 2013 - this study, we suggest a tabu search algorithm that incorpo- ... greedy algorithms, and the result shows that the tabu search algorithm gives ...
Int J Adv Manuf Technol (2013) 69:2081–2089 DOI 10.1007/s00170-013-5192-6
ORIGINAL ARTICLE
A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness Jae-Ho Lee & Jae-Min Yu & Dong-Ho Lee
Received: 28 December 2010 / Accepted: 9 July 2013 / Published online: 24 July 2013 # Springer-Verlag London 2013
Abstract 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., Rm│Sijk│∑Tj. Since the parallel machines are unrelated, sequencedependent 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.
Keywords Scheduling . Unrelated parallel machines . Sequence- and machine-dependent setups . Total tardiness . Tabu search
