Genetic Algorithm For Open Shop Scheduling Problem

In this paper, we present a genetic algorithm for the open shop scheduling problem. We use a simple and efficient chromosome representation based on the job's occurrence and the fitness function reflect the length of the schedule. The solutions obtained after performing the different operators of the genetic algorithm are always feasible. Heuristic approaches are also developed to generate the initial population and to improve the obtained solutions. The algorithm was implemented and computational results show interesting result.