A memetic algorithm for a multicriteria flexible job shop scheduling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

A memetic algorithm for a multicriteria flexible job shop scheduling

Résumé

We consider a flexible job shop scheduling problem coming from printing and boarding industry. A memetic algorithm is proposed to find a set of on-dominated solutions for the makespan and the maximum lateness criteria. A memetic algorithm is a genetic algorithm hybridized with a local search. Our genetic algorithm is based on NSGA-II where the mutation has been replaced by a Tabu Search algorithm based on a linear combination of criteria. Computational results show the interest of the combination of the two approaches.
Fichier non déposé

Dates et versions

hal-01025593 , version 1 (18-07-2014)

Identifiants

  • HAL Id : hal-01025593 , version 1

Citer

Geoffrey Vilcot, Jean-Charles Billaut. A memetic algorithm for a multicriteria flexible job shop scheduling. 22st European Conference on Operational Research, Jul 2007, Prague, Czech Republic. pp.95. ⟨hal-01025593⟩
26 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More