0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Buy Now

Constraint-Based Scheduling - Applying Constraint Programming to Scheduling Problems (Hardcover, 2001 ed.) Loot Price: R5,828
Discovery Miles 58 280
Constraint-Based Scheduling - Applying Constraint Programming to Scheduling Problems (Hardcover, 2001 ed.): Philippe Baptiste,...

Constraint-Based Scheduling - Applying Constraint Programming to Scheduling Problems (Hardcover, 2001 ed.)

Philippe Baptiste, Claude le Pape, Wim Nuijten

Series: International Series in Operations Research & Management Science, 39

 (sign in to rate)
Loot Price R5,828 Discovery Miles 58 280 | Repayment Terms: R546 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer
Country of origin: Netherlands
Series: International Series in Operations Research & Management Science, 39
Release date: July 2001
First published: 2001
Authors: Philippe Baptiste • Claude le Pape • Wim Nuijten
Dimensions: 235 x 155 x 19mm (L x W x T)
Format: Hardcover
Pages: 198
Edition: 2001 ed.
ISBN-13: 978-0-7923-7408-4
Categories: Books > Computing & IT > Computer programming > General
Books > Science & Mathematics > Mathematics > Optimization > General
Books > Science & Mathematics > Mathematics > Applied mathematics > General
Promotions
LSN: 0-7923-7408-8
Barcode: 9780792374084

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners