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
[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)