International Journal of Operations Research
In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the same problem. The computational results show that the proposed tabu search procedure generally outperfoms the existing heuristic for small- and large-sized problems.
Original Publication Citation
Helal, M., Rabadi, G., & Al-Salem, A. (2006). A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. International Journal of Operations Research, 3(3), 182-192. http://www.orstw.org.tw/ijor/vol3no3/Paper-3--IJOR-Vol3_3_-Ghaith%20Rabadi.pdf
Helal, Magdy; Rabadi, Ghaith; and Al-Salem, Ameer, "A Tabu Search Algorithm to Minimize the Makespan for the Unrelated Parallel Machines Scheduling Problem with Setup Times" (2006). Engineering Management & Systems Engineering Faculty Publications. 104.