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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | article |
| منشور في: |
2016
|
| الوصول للمادة أونلاين: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513465745408000 |
|---|---|
| author | Harmanani, Haidar M. |
| author2 | Bou Ghosn, Steve Drouby, Fouad |
| author2_role | author author |
| author_facet | Harmanani, Haidar M. Bou Ghosn, Steve Drouby, Fouad |
| author_role | author |
| dc.creator.none.fl_str_mv | Harmanani, Haidar M. Bou Ghosn, Steve Drouby, Fouad |
| dc.date.none.fl_str_mv | 2016 2017-02-21T14:20:14Z 2017-02-21T14:20:14Z 2017-02-21 |
| dc.identifier.none.fl_str_mv | 0974-0635 http://hdl.handle.net/10725/5260 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. http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.aut.upt.ro/~rprecup/IJAI_28.pdf |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | International Journal of Artificial Intelligence |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.title.none.fl_str_mv | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves |
| dc.type.none.fl_str_mv | Article info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | 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. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | LAURepo_b7ffdee00fc2e8488908233f43f0afea |
| identifier_str_mv | 0974-0635 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. |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/5260 |
| publishDate | 2016 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random MovesHarmanani, Haidar M.Bou Ghosn, SteveDrouby, FouadThis 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.PublishedN/A2017-02-21T14:20:14Z2017-02-21T14:20:14Z20162017-02-21Articleinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article0974-0635http://hdl.handle.net/10725/5260Ghosn, 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.http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttp://www.aut.upt.ro/~rprecup/IJAI_28.pdfenInternational Journal of Artificial Intelligenceinfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/52602021-03-19T10:03:24Z |
| spellingShingle | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves Harmanani, Haidar M. |
| status_str | publishedVersion |
| title | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves |
| title_full | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves |
| title_fullStr | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves |
| title_full_unstemmed | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves |
| title_short | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves |
| title_sort | A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves |
| url | 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 |