{"product_id":"9780792374084","title":"International Series in Operations Research \u0026 Management Science: Applying Constraint Programming to Scheduling Problems","description":"\u003ch1\u003eInternational Series in Operations Research \u0026amp; Management Science: Applying Constraint Programming to Scheduling Problems\u003c\/h1\u003e \u003ch2\u003eBaptiste, Philippe; Le Pape, Claude; Nuijten, Wim\u003c\/h2\u003e \u003cp\u003eConstraint 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. \u003cbr\u003e  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. \u003cbr\u003e  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:  \u003c\/p\u003e\u003cul\u003e \u003cli\u003e 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. \u003c\/li\u003e  \u003cli\u003e 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. \u003c\/li\u003e  \u003cli\u003e 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). \u003c\/li\u003e  \u003c\/ul\u003e     Chapter 9 mentions various extensions of the model and presents  promising research directions. \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2001-07-31\u003c\/p\u003e \u003cp\u003eFormat: Hardcover\u003c\/p\u003e \u003cp\u003eISBN-13: 9780792374084\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4615-1479-4\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 198\u003c\/p\u003e ","brand":"Springer US","offers":[{"title":"Default Title","offer_id":45378464317580,"sku":"9780792374084","price":197.1,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9780792374084.jpg?v=1775682460","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9780792374084","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}