Metaheuristics for identical parallel machines scheduling to minimize mean tardiness

摘要

Scheduling of jobs has been a challenging task in manufacturing and the most real life scheduling problems, which involves multi-objectives and multi-machine environments. This paper presents tabu search and simulated annealing approaches for scheduling jobs on identical parallel machines. The identical parallel machine scheduling problem has been considered to minimize the mean tardiness for the jobs. Initially, an initial solution has been obtained using EDD dispatching rule then, simulated annealing and tabu search have been applied to reach a near optimal solution. Computational experiments are performed on problems with up to 10 machines and 150 jobs. The computational results indicate that the two proposed approaches are capable of obtaining better solutions for the given scheduling problem. Moreover, the tabu search approach provides better solution then simulated annealing approach.