Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems / Edition 1by Philippe Baptiste, Claude Le Pape, Wim Nuijten
Pub. Date: 07/01/2001
Publisher: Springer US
It is because of these capabilities that Constraint
Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem.
It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study.
The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts:
- The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems.
- Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsible for the "hardness" of the scheduling problem.
- Chapters 6, 7, and 8 are dedicated to the resolution of several scheduling problems. These examples illustrate the use and the practical efficiency of the constraint propagation methods of the previous chapters. They also show that besides constraint propagation, the exploration of the search space must be carefully designed, taking into account specific properties of the considered problem (e.g., dominance relations, symmetries, possible use of decomposition rules).
- Springer US
- Publication date:
- International Series in Operations Research & Management Science, #39
- Edition description:
- Product dimensions:
- 6.10(w) x 9.25(h) x 0.02(d)
Table of ContentsForeword. Preface. Acknowledgements. 1. Introduction. 2. Propagation of the One-Machine Resource Constraint. 3. Propagation of Cumulative Constraints. 4. Comparison of Propagation Techniques. 5. Propagation of Objective Functions. 6. Resolution of Disjunctive Problems. 7. Cumulative Scheduling Problems. 8. Min-Sum Scheduling Problems. 9. Conclusion. 10. Summary of Notation. References. Index.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >