Baker [9] defines scheduling as the problem of allocating scarce resources to activities over time1. In<br />this manuscript, we consider several scheduling problems with a variety of different environments.<br />The two parts of this manuscript provide an overview of two of our major research interests. The first<br />part (Chapters 2 to 5) is dedicated to polynomial time solutions of equal{processing{time scheduling<br />problems. The second one (Chapters 7 to 15) deals with the application of Constraint Programming<br />to scheduling. These two parts re<br />ect the balance we have tried to keep between theoretical and<br />more applied research.<br />Although all the topics covered in this manuscript are related to scheduling, Parts 1 and 2 are<br />dedicated to very different aspects of scheduling. Some few results discussed in Part 1 are occasionally<br />used in Part 2 but they are independent one from another. In the following, we brie<br />y review the<br />content Parts 1 and 2. More detailed introductions are provided in Sections 1 and 7 respectively.
| Identifer | oai:union.ndltd.org:CCSD/oai:tel.archives-ouvertes.fr:tel-00124998 |
| Date | 01 July 2002 |
| Creators | Baptiste, Philippe |
| Publisher | Université de Technologie de Compiègne |
| Source Sets | CCSD theses-EN-ligne, France |
| Language | English |
| Detected Language | English |
| Type | habilitation ࠤiriger des recherches |
Page generated in 0.0185 seconds