Genetic Algorithm for Open Shop Scheduling Problem - Université de Lorraine Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Genetic Algorithm for Open Shop Scheduling Problem

Résumé

In this paper, we present a genetic algorithm for the open shop scheduling problem. We use a simple and efficient chromosome representation based on the job's occurrence and the fitness function reflect the length of the schedule. The solutions obtained after performing the different operators of the genetic algorithm are always feasible. Heuristic approaches are also developed to generate the initial population and to improve the obtained solutions. The algorithm was implemented and computational results show interesting result.
Fichier principal
Vignette du fichier
2018_Codit_239_YB.pdf (115.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03791506 , version 1 (29-09-2022)

Identifiants

Citer

Yacine Benziani, Imed Kacem, Pierre Laroche. Genetic Algorithm for Open Shop Scheduling Problem. 2018 5th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2018, Thessaloniki, France. pp.935-939, ⟨10.1109/CoDIT.2018.8394932⟩. ⟨hal-03791506⟩
25 Consultations
189 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More