Comparison study for some local search methods for multiple objective function in a single machine scheduling problem

Abstract EN

In this paper we considered multiple objective function on single machine scheduling problem.

The aim is solving the problem Σni = 1 (ai Ei + βi Ti + yiCi), Minimizing the Weighted sum of earliness, tardiness and completion time.

As this problem is strongly NPhard.

So we used local search methods, genetic algorithm and we suggested a hybrid method to find approximate solutions.

The results are cooperated with the optimal solution in [1] and [2] in case n (no.

of jobs) less than or equal to 35 jobs, and in case n greater than 35 jobs, the results are compared which obtained from above methods.

We notes that the hybrid method is the best.

As it illustrated in the tables and figures.