Constraint satisfaction problems are ubiquitous. A simple example that we will use throughout the first half of this chapter is the following scheduling problem: Choose employees A or B for each of three tasks, X, Y, Z, subject to the work rules that the same employee cannot carry out both tasks X and Y, the same employee cannot carry out both tasks Y and Z, and only employee B is allowed to carry out task Z. (Many readers will recognize this as a simple coloring problem.).
|Title of host publication||Search Methodologies|
|Subtitle of host publication||Introductory Tutorials in Optimization and Decision Support Techniques|
|Editors||Edmund K. Burke, Graham Kendall|
|Place of Publication||New York, New York|
|Number of pages||33|
|Publication status||Published - 1 Jan 2014|