Interactive scheduling as a constraint satisfiability problem

Ronen Feldman*, Martin Charles Golumbic

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

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 Nudel 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. Experimental results have been collected and are reported here. Our system was developed for and used at Bar-Ilan University during the registration period, being available for students to construct their timetables.

Original languageAmerican English
Pages (from-to)49-73
Number of pages25
JournalAnnals of Mathematics and Artificial Intelligence
Volume1
Issue number1-4
DOIs
StatePublished - Sep 1990
Externally publishedYes

Keywords

  • Constraint satisfiability
  • scheduling
  • search

Fingerprint

Dive into the research topics of 'Interactive scheduling as a constraint satisfiability problem'. Together they form a unique fingerprint.

Cite this