Unrelated parallel machine scheduling with sequence- and machine-dependent setups

초록

We consider the problem of scheduling independent jobs on parallel machines with machine- and sequence-dependent setup times for the objective of minimizing the total tardiness. Here, the parallel machines are unrelated, and hence sequencedependent setup times depend on machines. To the best our knowledge, there is only one previous research article that suggests a simulated annealing algorithm for the problem with a constraint that some jobs have deadlines that must be satisfied. For a more general case without the additional constraint, we suggest a tabu search algorithm that incorporates various neighborhood generation methods. Computational experiments were done on a number of randomly generated test instances and the results show that the tabu search algorithm suggested in this study outperforms the existing algorithm significantly. In particular, the tabu search algorithm gave optimal solutions for more than 50% of small sized test instances.