Genetic Algorithm for flowshop scheduling problem using data oriented operators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Genetic Algorithm for flowshop scheduling problem using data oriented operators

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.

Domains

Other [cs.OH]
No file

Dates and versions

inria-00098866 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00098866 , version 1

Cite

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⟩
53 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More