A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves
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. Com...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/10725/5260 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.aut.upt.ro/~rprecup/IJAI_28.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|