Skip to Main content Skip to Navigation
Theses

Algorithmes approchés pour des problèmes d'ordonnancement multicritères de type job shop flexible et job shop multiressource

Abstract : 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 developed, 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.
Document type :
Theses
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00198068
Contributor : Geoffrey Vilcot <>
Submitted on : Sunday, December 16, 2007 - 10:16:45 AM
Last modification on : Tuesday, February 2, 2021 - 3:48:10 PM
Long-term archiving on: : Monday, April 12, 2010 - 8:05:07 AM

Identifiers

  • HAL Id : tel-00198068, version 1

Citation

Geoffrey Vilcot. Algorithmes approchés pour des problèmes d'ordonnancement multicritères de type job shop flexible et job shop multiressource. Autre [cs.OH]. Université François Rabelais - Tours, 2007. Français. ⟨tel-00198068⟩

Share

Metrics

Record views

815

Files downloads

501