A Genetic Algorithm For A Bicriteria Flexible Job Shop Scheduling Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

A Genetic Algorithm For A Bicriteria Flexible Job Shop Scheduling Problem

Résumé

The problem we consider in this paper is a flexible job shop scheduling problem. The aim is to minimize two criteria: the makespan and the maximum lateness and we are interested in finding an approximation of the Pareto front. The method that we propose is a genetic algorithm. The initial population is partially generated by using a tabu search algorithm which minimizes a linear combination of the two criteria. The method is tested on benchmark instances from literature
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01025536 , version 1

Citer

Vilcot Geoffrey, Jean-Charles Billaut, Esswein Carl. A Genetic Algorithm For A Bicriteria Flexible Job Shop Scheduling Problem. IEEE International Conference on service Systems and Service Managament, Oct 2006, Troyes, France. pp.1240-1244. ⟨hal-01025536⟩
25 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More