Initial populations tests for genetic algorithm flowshop scheduling problems solving with a special blocking - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Initial populations tests for genetic algorithm flowshop scheduling problems solving with a special blocking

Abstract

In this paper, we consider a flowshop scheduling problem with a special blocking RCb (Release when Completing Blocking). This flexible production system is prevalent in some industrial environments. We propose genetic algorithms for solving these flowshop problems and different initial populations are tested to find the best adapted. Then, different parameters sets are tested in order to find the best for further genetic algorithms populations selection. Best parameters set and results are endly discussed.
Fichier principal
Vignette du fichier
[2009 Incom, Sauvey and Sauer] Initial populations tests for genetic algorithm flowshop scheduling.pdf (196.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00600379 , version 1 (06-02-2023)

Identifiers

Cite

Christophe Sauvey, Nathalie Sauer. Initial populations tests for genetic algorithm flowshop scheduling problems solving with a special blocking. 13th IFAC Symposium on Information Control problems in manufacturing, Jun 2009, Moscou, Russia. pp.1961-1966, ⟨10.3182/20090603-3-RU-2001.00330⟩. ⟨inria-00600379⟩
77 View
3 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More