Comparative Analysis of Simulated Annealing and Tabu Search for Parallel Machine Scheduling

Abstract

This paper compares the performance of Simulated Annealing and Tabu Search meta-heuristics in addressing a parallel machine scheduling problem aimed at minimizing weighted earliness, tardiness, total flowtime, and machine deterioration costs—a multi-objective optimization problem. The problem is transformed into a single-objective problem using weighting and weighting relative distance methods. Four scenarios, varying in the number of jobs and machines, are created to evaluate these metaheuristics. Computational experiments indicate that Simulated Annealing consistently yields superior solutions compared to Tabu Search in scenarios with lower dimensions despite longer run times. Conversely, Tabu Search performs better in higher-dimensional scenarios. Furthermore, it is observed that solutions generated by different weighting methods exhibit similar performance.