Scheduling jobs with families setups on identical parallelmachines to minimize makespan function

This paper considers the problem of scheduling independent jobs on identical parallelmachines with family setup times. The preemption of jobs is forbidden. The aim is to minimizemakespan. We develop compare and test different local search methods such as Memeticalgorithm approach (MA), Threshold acceptance algorithm (TH) and Tabu search (TS).Computational experience is found that these local search algorithms solve problem to 5000 jobswith reasonable time.