A Survey on Parallel Genetic Algorithms for Shop Scheduling Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

A Survey on Parallel Genetic Algorithms for Shop Scheduling Problems

Jia Luo
Didier El Baz

Résumé

There have been extensive works dealing with genetic algorithms (GAs) for seeking optimal solutions of shop scheduling problems. Due to the NP hardness, the time cost is always heavy. With the development of high performance computing (HPC) in last decades, the interest has been focused on parallel GAs for shop scheduling problems. In this paper, we present the state of the art with respect to the recent works on solving shop scheduling problems using parallel GAs. It showcases the most representative publications in this field by the categorization of parallel GAs and analyzes their designs based on the frameworks.
Fichier principal
Vignette du fichier
pdco ieee full version final-1.pdf (472.38 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02091699 , version 1 (06-04-2019)

Identifiants

Citer

Jia Luo, Didier El Baz. A Survey on Parallel Genetic Algorithms for Shop Scheduling Problems. IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW 2018), May 2018, Vancouver, Canada. pp.629-636, ⟨10.1109/IPDPSW.2018.00103⟩. ⟨hal-02091699⟩
19 Consultations
14 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More