The aim of this paper is to compare the performance of two meta-heuristic methods proposed to solve the identical parallel machine scheduling problem with sequence dependent setup times. The goal is to minimize the makespan. The first algorithm is a tabu search based heuristic and the second a memetic approach, which combines a population-based method with local search procedures. As benchmarks for small-sized instances, optimal and lower bound values are used provided by a dichotomous search. For larger instances, the comparisons rely on the best known solutions provided by an exhaustive search variant of the tabu procedure.132143154