Ali Gholam Nataj - Department of Computer Pardisan Institute of Higher Education Fereydonkenar, Iran
Ayoob Ramezani - Department of Computer Massive Process Engineering Institute Amol, Iran
Hossein Mozafari - Department of Computer Pardisan Institute of Higher Education Fereydonkenar, Iran
Zohreh Mahdavi - Department of Computer Massive Process Engineering Institute Amol, Iran

In scheduling problems, we have a limited number of resources that should be allocated to some activities during a time interval. Open-shop scheduling is a kind of scheduling that is categorized as difficult problems. In this paper, we try to solve the open-shop problem by a parallel genetic algorithm. This algorithm uses several auxiliary genetic algorithms in parallel to raise the ability of the main genetic algorithm at convergence time and search more points of the problem space. Finally, this algorithm is tested on some standard problems in this field and acceptable results are presented.

Elitism; Parallel Genetic Algorithm; Open Shop