Constraint Satisfiability Algorithms for Interactive Student Scheduling

A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these variables. A solution to the CSP is an instantiation (or labeling) of all the variables which does not violate any of the constraints. Since constraint satisfiability problems are, in general, NP-complete, it is of interest to compare the effectiveness and efficiency of heuristic algorithms as applied, in particular, to our application. Our research effort attempts to determine which algorithms perform best in solving the student scheduling problem (SSP) and under what conditions. We also investigate the probabilistic techniques of Nudcl for finding a near optimal instantiation order for search algorithms, and develop our own modifications which can yield a significant improvement in efficiency for the SSP. Finally, we assign priorities to the constraints and investigate optimization algorithms for finding schedu...

• Type: Conference
• Year: 1989
• Where: IJCAI
• Authors: Ronen Feldman, Martin Charles Golumbic
• Keywords: Algorithms, Constraint Satisfiability Problems, IJCAI 1989, IJCAI 2007, Optimal Instantiation Order