Skip to Main content Skip to Navigation
Theses

Méthodes hybrides de programmation par contraintes et programmation linéaire pour le problème d'ordonnancement de projet à contraintes de ressources

Abstract : States-of-the-art of the RCPSP and of constraint programming-linear programming hybrid methods.
Hybrid approaches of CP and ILP for the RCPSP: lower bounds computation by CP-based lagrangian relaxation; CP-based column generation and CP-based cutting-plane generation.
Application of a generic, exact, and non-tree search method, Resolution Search, proposed by Vlasek Chvatal. Links with dynamic backtracking and nogood learning approaches in CP.
Document type :
Theses
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00293564
Contributor : Sophie Demassey <>
Submitted on : Saturday, July 5, 2008 - 6:14:38 PM
Last modification on : Tuesday, January 14, 2020 - 10:38:05 AM
Long-term archiving on: : Friday, May 28, 2010 - 11:12:33 PM

Identifiers

  • HAL Id : tel-00293564, version 1

Citation

Sophie Demassey. Méthodes hybrides de programmation par contraintes et programmation linéaire pour le problème d'ordonnancement de projet à contraintes de ressources. Modélisation et simulation. Université d'Avignon, 2003. Français. ⟨tel-00293564⟩

Share

Metrics

Record views

939

Files downloads

4276