Document Type
Book Chapter
Publication Date
1-1-2004
Abstract
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
Copyright
Copyright © 2004, from Taylor and Francis Group, LLC, a division of Informa plc.
Handbook of Scheduling: Algorithms, Models, and Performance Analysis, by Joseph Y-T. Leung. Reproduced by permission of Taylor and Francis Group, LLC, a division of Informa plc. This material is strictly for personal use. For any other use, the user must contact Taylor & Francis directly at this address: permissions.mailbox@taylorandfrancis.com. Printing, photocopying and sharing via any means is a violation of copyright.
Place of Publication
Boca Raton, FL
Citation Information
John J. Kanet, Sanjay L. Ahire and Michael F. Gorman. "Constraint Programming for Scheduling"
Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004)
Available at: http://works.bepress.com/michael_gorman/1/
Permission documentation is on file.