Constraint-Based Scheduling | Applying Constraint Programming to Scheduling Problems

Philippe Baptiste (u. a.)

ISBN 10: 0792374088 / ISBN 13: 9780792374084

Published by Springer, 2001

About this Item

Constraint-Based Scheduling | Applying Constraint Programming to Scheduling Problems | Philippe Baptiste (u. a.) | Buch | xiii | Englisch | 2001 | Springer | EAN 9780792374084 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Seller Inventory # 102573697

Bibliographic Details

• Title: Constraint-Based Scheduling | Applying Constraint Programming to Scheduling Problems
• Publisher: Springer
• Publication Date: 2001
• Language: English
• ISBN 10: 0792374088
• ISBN 13: 9780792374084
• Binding: Buch
• Condition: Neu
• Dimensions: 241W x 160H x 17D millimeters 241 millimeters width by 160 millimeters height by 17 millimeters depth
• Weight: 500 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.