Consider a scheduling problem, where there are 5 activities to be scheduled in 4 time slots. Suppose
Fantastic news! We've Found the answer you've been seeking!
Question:
Consider a scheduling problem, where there are 5 activities to be scheduled in 4 time slots. Suppose we represent the activities by the variables A, B, C, D, and E where the domain of each variable is {1, 2, 3, 4} and the constraints are: A > D, D > E, C ¹A, C > E, C ¹D, B ≥ A, B ¹C, C ¹D + 1.
Show how arc consistency can be used to solve this problem. To do this you need to
•draw the constraint graph,
•show which elements of a domain are deleted at each step, and which arc is responsible for removing the element,
•show explicitly the constraint graph after arc consistency has stopped. You may need to split a domain to solve the problem
Related Book For
Elementary Linear Algebra with Applications
ISBN: 978-0471669593
9th edition
Authors: Howard Anton, Chris Rorres
Posted Date: