1. Introduction. - 1. 1 Introduction to Constraint Programming. - 1. 2 Scheduling Theory. - 1. 3 A Constraint-Based Scheduling Model. - 2. Propagation of the One-Machine Resource Constraint. - 2. 1 Non-Preemptive Problems. - 2. 2 Preemptive Problems. - 3. Propagation of Cumulative Constraints. - 3. 1 Fully Elastic Problems. - 3. 2 Preemptive Problems. - 3. 3 Non-Preemptive Problems. - 4. Comparison of Propagation Techniques. - 4. 1 Constraint Propagation Rules. - 4. 2 Dominance Relations. - 4. 3 Non-Dominance Relations. - 4. 4 Summary. - 5. Propagation of Objective Functions. - 5. 1 Total Weighted Number of Late Activities. - 5. 2 Sum of Transition Times and Sum of Transition Costs. - 5. 3 Conclusion. - 6. Resolution of Disjunctive Problems. - 6. 1 Job-Shop Scheduling. - 6. 2 Open-Shop Scheduling. - 6. 3 Preemptive Job-Shop Scheduling. - 7. Cumulative Scheduling Problems. - 7. 1 General Framework. - 7. 2 Hybrid Flow-Shop Scheduling. - 7. 3 Resource-Constrained Project Scheduling. - 7. 4 Conclusion. - 8. Min-Sum Scheduling Problems. - 8. 1 Minimizing the Weighted Number of Late Jobs. - 8. 2 Minimizing Makespan and Sum of Transition Times. - 9. Conclusion. - 10. Summary of Notation. - References. Language: English