Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

Résultats de complexité et programmation par contraintes pour l'ordonnancement

Abstract : Baker [9] defines scheduling as the problem of allocating scarce resources to activities over time1. In
this manuscript, we consider several scheduling problems with a variety of different environments.
The two parts of this manuscript provide an overview of two of our major research interests. The first
part (Chapters 2 to 5) is dedicated to polynomial time solutions of equal{processing{time scheduling
problems. The second one (Chapters 7 to 15) deals with the application of Constraint Programming
to scheduling. These two parts re
ect the balance we have tried to keep between theoretical and
more applied research.
Although all the topics covered in this manuscript are related to scheduling, Parts 1 and 2 are
dedicated to very different aspects of scheduling. Some few results discussed in Part 1 are occasionally
used in Part 2 but they are independent one from another. In the following, we brie
y review the
content Parts 1 and 2. More detailed introductions are provided in Sections 1 and 7 respectively.
keyword : scheduling
Document type :
Habilitation à diriger des recherches
Complete list of metadata

Cited literature [207 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00124998
Contributor : Philippe Baptiste <>
Submitted on : Wednesday, January 17, 2007 - 11:36:49 AM
Last modification on : Thursday, March 5, 2020 - 6:21:30 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 9:02:21 PM

File

Identifiers

  • HAL Id : tel-00124998, version 1

Collections

Citation

Philippe Baptiste. Résultats de complexité et programmation par contraintes pour l'ordonnancement. Other [cs.OH]. Université de Technologie de Compiègne, 2002. ⟨tel-00124998⟩

Share

Metrics

Record views

483

Files downloads

366