Keywords : Heuristic
journal of kerbala university,
Volume 11, Issue 2, Pages 188-197
This paper considers the problem of scheduling n independent jobs on m identical parallel machines with family setup times. The preemption of jobs is forbidden. The aim is to minimize makespan. We develop compare and test different local search methods such as Memetic algorithm approach (MA), Threshold acceptance algorithm (TH) and Tabu search (TS). Computational experience is found that these local search algorithms solve problem to 5000 jobs with reasonable time.