Document Type

Book Chapter

Publication Date


Publication Source

Handbook of Scheduling: Algorithms, Models, and Performance Analysis


Our goal is to introduce the constraint programming (CP) approach within the context of scheduling. We start with an introduction to CP and its distinct technical vocabulary. We then present and illustrate a general algorithm for solving a CP problem with a simple scheduling example.

Next, we review several published studies where CP has been used in scheduling problems so as to provide a feel for its applicability. We discuss the advantages of CP in modeling and solving certain types of scheduling problems. We then provide an illustration of the use of a commercial CP tool (OPL Studio) in modeling and designing a solution procedure for a classic problem in scheduling.

We conclude with our speculations about the future of scheduling research using this approach.

Inclusive pages

47-1 to 47-21



Document Version

Published Version


Permission documentation is on file.


CRC Press

Place of Publication

Boca Raton, FL