rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Constraint-Based Scheduling
    sub title: Applying Constraint Programming to Scheduling Problems
  name:
    name part: Baptiste, Philippe.
    role:
      role term: creator
  name:
    name part: Pape, Claude.
  name:
    name part: Nuijten, Wim.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: xxu
    date issued: 2001
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (xiii, 198 pages)
  abstract: 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.
  note: by Philippe Baptiste, Claude Pape, Wim Nuijten.
  note: Electronic resource.
  subject:
    topic: Mathematics
  subject:
    topic: Information theory
  subject:
    topic: Mathematical optimization
  subject:
    topic: Operations research
  subject:
    topic: Information theory
  subject:
    topic: Mathematical optimization
  subject:
    topic: Mathematics
  subject:
    topic: Operations research
  classification: QA402.5-402.6
  classification: 519.6
  related item:
    title info:
      title: International series in operations research & management science ; 39
  identifier: 9781461514794 (electronic bk.)
  identifier: 1461514797 (electronic bk.)
  identifier: 9781461355748
  identifier: 1461355745
  identifier: 1461514797
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: AU@
    record creation date: 121227
    record change date: 20260422200808.8
    record identifier: in00003569110
    language of cataloging:
      language term: eng