Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems /
.
Bookmark this Record
Catalogue Record 46695
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 46695
.
Reviews
Catalogue Record 46695
.
British Library
Resolver for RSN-46695
Google Scholar
Resolver for RSN-46695
WorldCat
Resolver for RSN-46695
Catalogo Nazionale SBN
Resolver for RSN-46695
GoogleBooks
Resolver for RSN-46695
ICTP Library
Resolver for RSN-46695
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
519.6
Title
Constraint-Based Scheduling ([EBook] :) : Applying Constraint Programming to Scheduling Problems / / by Philippe Baptiste, Claude Le Pape, Wim Nuijten.
Author
Baptiste, Philippe
Added Personal Name
Pape, Claude Le
author.
Nuijten, Wim
author.
Other name(s)
SpringerLink (Online service)
Publication
Boston, MA : : Springer US : : Imprint: Springer, , 2001.
Physical Details
XIII, 198 p. : online resource.
Series
International Series in Operations Research & Management Science
0884-8289 ; ; 39
ISBN
9781461514794
Summary Note
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.:
Contents note
1. Introduction -- 1.1 Introduction to Constraint Programming -- 1.2 Scheduling Theory -- 1.3 A Constraint-Based Scheduling Model -- 2. Propagation of the One-Machine Resource Constraint -- 2.1 Non-Preemptive Problems -- 2.2 Preemptive Problems -- 3. Propagation of Cumulative Constraints -- 3.1 Fully Elastic Problems -- 3.2 Preemptive Problems -- 3.3 Non-Preemptive Problems -- 4. Comparison of Propagation Techniques -- 4.1 Constraint Propagation Rules -- 4.2 Dominance Relations -- 4.3 Non-Dominance Relations -- 4.4 Summary -- 5. Propagation of Objective Functions -- 5.1 Total Weighted Number of Late Activities -- 5.2 Sum of Transition Times and Sum of Transition Costs -- 5.3 Conclusion -- 6. Resolution of Disjunctive Problems -- 6.1 Job-Shop Scheduling -- 6.2 Open-Shop Scheduling -- 6.3 Preemptive Job-Shop Scheduling -- 7. Cumulative Scheduling Problems -- 7.1 General Framework -- 7.2 Hybrid Flow-Shop Scheduling -- 7.3 Resource-Constrained Project Scheduling -- 7.4 Conclusion -- 8. Min-Sum Scheduling Problems -- 8.1 Minimizing the Weighted Number of Late Jobs -- 8.2 Minimizing Makespan and Sum of Transition Times -- 9. Conclusion -- 10. Summary of Notation -- References.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-1-4615-1479-4
Links to Related Works
Subject References:
Calculus of variations
.
Calculus of variations and optimal control; optimization
.
Computers
.
Decision making
.
Mathematical optimization
.
Mathematics
.
Operation Research/Decision Theory
.
Operations research
.
Optimization
.
Theory of Computation
.
Authors:
Baptiste, Philippe
.
Nuijten, Wim
.
Pape, Claude Le
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
International Series in Operations Research & Management Science
.
Classification:
519.6
.
.
ISBD Display
Catalogue Record 46695
.
Tag Display
Catalogue Record 46695
.
Related Works
Catalogue Record 46695
.
Marc XML
Catalogue Record 46695
.
Add Title to Basket
Catalogue Record 46695
.
Catalogue Information 46695
Beginning of record
.
Catalogue Information 46695
Top of page
.
Download Title
Catalogue Record 46695
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
46695
1
46695
-
2
46695
-
3
46695
-
4
46695
-
5
46695
-
Quick Search
Search for