More than 1,900 Springer Protocols eBooks at just $9.99 each! Get yours today>>

International Series in Operations Research & Management Science

Constraint-Based Scheduling

Applying Constraint Programming to Scheduling Problems

Authors: Baptiste, Philippe, Le Pape, Claude, Nuijten, Wim

Buy this book

eBook $209.00
price for USA (gross)
  • ISBN 978-1-4615-1479-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $269.00
price for USA
  • ISBN 978-0-7923-7408-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $269.00
price for USA
  • ISBN 978-1-4613-5574-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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).
Chapter 9 mentions various extensions of the model and presents promising research directions.

Table of contents (10 chapters)

  • Introduction

    Baptiste, Philippe (et al.)

    Pages 1-18

  • Propagation of the One-Machine Resource Constraint

    Baptiste, Philippe (et al.)

    Pages 19-41

  • Propagation of Cumulative Constraints

    Baptiste, Philippe (et al.)

    Pages 43-75

  • Comparison of Propagation Techniques

    Baptiste, Philippe (et al.)

    Pages 77-104

  • Propagation of Objective Functions

    Baptiste, Philippe (et al.)

    Pages 105-127

Buy this book

eBook $209.00
price for USA (gross)
  • ISBN 978-1-4615-1479-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $269.00
price for USA
  • ISBN 978-0-7923-7408-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $269.00
price for USA
  • ISBN 978-1-4613-5574-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Constraint-Based Scheduling
Book Subtitle
Applying Constraint Programming to Scheduling Problems
Authors
Series Title
International Series in Operations Research & Management Science
Series Volume
39
Copyright
2001
Publisher
Springer US
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4615-1479-4
DOI
10.1007/978-1-4615-1479-4
Hardcover ISBN
978-0-7923-7408-4
Softcover ISBN
978-1-4613-5574-8
Series ISSN
0884-8289
Edition Number
1
Number of Pages
XIII, 198
Topics