Genetic algorithms for solving open shop scheduling problems

Abstract

In this paper we investigate the use of three evolutionary based heuristics to the open shop scheduling problem. The intractability of this problem is a motivation for the pursuit of heuristics that produce approximate solutions. This work introduces three evolutionary based heuristics, namely, a permutation genetic algorithm, a hybrid genetic algorithm and a selfish gene algorithm, and tests their applicability to the open shop scheduling problem. Several problem instances are used with our evolutionary based algorithms. We compare the results and conclude with some observations and suggestions on the use of evolutionary heuristics for scheduling problems. We also report on the success that our hybrid genetic algorithm has had on one of the large benchmark problem instances: our heuristic has produced a better solution than the current best known solution.