Genetic Algorithm for Open Shop Scheduling Problem - Université de Lorraine Access content directly
Conference Papers Year : 2018

Genetic Algorithm for Open Shop Scheduling Problem


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
Origin : Files produced by the author(s)

Dates and versions

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



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⟩
20 View
107 Download



Gmail Facebook X LinkedIn More