Genetic algorithm and particle swarm optimization techniques for solving multi-objectives on single machine scheduling problem

Abstract EN

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as 1 //£;=x ( Cj + Tj + Ej + Vj) (total completion time, total tardiness, total earliness and the total late work).

A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18).

The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate time.