A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves
Steve Bou Ghosn, Fouad Drouby, HAIDAR M. HARMANANI · 2016
This paper investigates the use of parallel genetic algorithms in order to solve the open-shop scheduling problem. The method is based on a novel implementation of genetic operators that combines the use of deterministic and random moves. The method is implemented using MPI on a Beowulf cluster. Comparisons using the Taillard benchmarks give favorable results for this algorithm.