Thèse soutenue

Algorithmes approchés pour des problèmes d'ordonnancement multicritères de type job shop flexible et job shop multiressource
FR  |  
EN
Accès à la thèse
Auteur / Autrice : Geoffrey Vilcot
Direction : Jean-Charles Billaut
Type : Thèse de doctorat
Discipline(s) : Informatique
Date : Soutenance en 2007
Etablissement(s) : Tours

Mots clés

FR

Mots clés contrôlés

Résumé

FR  |  
EN

This thesis was realized in the context of an industrial collaboration. In this work, we studied the multicriteria flexible job shop scheduling problem and the multicriteria multiprocessor tasks job shop scheduling problem. Our purpose was to find an approximation of the pareto frontier for these problems. Different meta heuristics were developped, such as Tabu search algorithms and genetic algorithms. Different versions of our methods were proposed for the two considered problems. Experiments show the good performances of our algorithms, both qualitative and computational aspects of our methods show satisfying results. This thesis was done in collaboration with Volume Software company within the framework of the development of the "DirectPlanning" scheduling engine.