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,

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

Step by Step Solution

3.36 Rating (168 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To solve the scheduling problem using arc consistency lets go through the provided steps systematically Arc consistency is a technique used in constra... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!