Using genetic algorithm to minimize single machine scheduling problem

Abstract EN

In this paper, the problem of scheduling n jobs on a single machine is considered.

The aim in this study is to find the near optimal solution for the discounted total weighted completion time? ? F JF ?? ?? F AF %F? with unequal release date by using Genetic algorithm.

Three special cases are derived and proved that yield optimal solutions.

Also, lower bound and upper bound that introduced in this study, in order to find the optimal solution by Branch and Bound algorithm and comparison with genetic algorithm.

Results of extensive computational tests show that proposed (Genetic Algorithm) is effective in solving problems up to (2000) jobs at a time less than or equal to (10) minutes.