A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves

Harmanani, Haidar M.; Bou Ghosn, Steve; Drouby, Fouad

A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves

Harmanani, Haidar M.; Bou Ghosn, Steve; Drouby, Fouad

URL: http://www.aut.upt.ro/~rprecup/IJAI_28.pdf

Date: 2017-02-21

Terms of Use: This item is made available under the terms and conditions applicable to " Article ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

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.

Citation:

Ghosn, S. B., Drouby, F., & Harmanani, H. M. (2016). A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves. International Journal of Artificial Intelligence™, 14(1), 130-144.