Abstract : The general flowshop scheduling problem is approximately solved using a genetic algorithm. Chromosomes are classically encoded using permutation strings for each machine. The data-oriented operators use both the permutation strings and problem instances. The beginning of one parent is copied inside the first offspring which is completed with a priority rule generator using data of the second parents. The second offspring is obtained in a similar way. Several cross-over operators are designed. Some of them work only on the permutation encoding, other ones are data oriented.
https://hal.inria.fr/inria-00098866
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:39:37 AM Last modification on : Friday, February 26, 2021 - 3:28:04 PM
Antony Vignier, Abdel Halim Mahdi, Marie-Claude Portmann. Genetic Algorithm for flowshop scheduling problem using data oriented operators. Optimization Days - JOPT'99, 1999, Montréal, Canada. ⟨inria-00098866⟩