Real data will be provided whenever possible. Given instructors preferences for teaching 4 classes, two graduate and two undergraduate, and given class requirements, assign instructor to classes and to quarters to maximally degree of satisfaction. Given class schedules for quarter, the number of TA needed for each class TA's preferences and qualification, and instructors' choice of preferred TA, schedule the TA's in a way that maximize some measure of staisfaction. The problem is to find a schedule for classes, classrooms, and teachers for a high-school. Measure of satisfaction can be to minimize the number of weighted constraints violated.
Some algorithms written by graduate students are available for binary CSPs.
Students can try to adapt those to the problem or code the algorithms from scratch. Students can also use the constraint programming language Eclipse.