Constraint-Based Scheduling

Applying Constraint Programming to Scheduling Problems

  • Philippe Baptiste
  • Claude Le Pape
  • Wim Nuijten

Part of the International Series in Operations Research & Management Science book series (ISOR, volume 39)

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 1-18
  3. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 19-41
  4. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 43-75
  5. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 77-104
  6. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 105-127
  7. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 129-147
  8. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 149-158
  9. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 159-174
  10. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 175-178
  11. Philippe Baptiste, Claude Le Pape, Wim Nuijten
    Pages 179-181
  12. Back Matter
    Pages 183-198

About this book

Introduction

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.

Keywords

Notation Resolution algorithms efficiency scheduling

Authors and affiliations

  • Philippe Baptiste
    • 1
  • Claude Le Pape
    • 2
  • Wim Nuijten
    • 2
  1. 1.CNRS, UMR 6599 HeudiasycUniversité de Technologie de CompiègneCompiègneFrance
  2. 2.ILOGGentillyFrance

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4615-1479-4
  • Copyright Information Kluwer Academic Publishers 2001
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-5574-8
  • Online ISBN 978-1-4615-1479-4
  • Series Print ISSN 0884-8289
  • About this book