The University of York
CONSTRAINT SATISFACTION AND COMBINATORIAL OPTIMISATION
Open Examination
Each year the Department of Computer Science interviews potential undergraduate
students in a series of interview session on different dates. Each session must be taffed
by a number of interviewers, with possibly different numbers being required on different
dates. Before the interview series starts, each interviewer indicates which sessions, if
any, he is unavailable for. The department's admissions tutor must then decide which
interviewers must serve at each interview session, ensuring that the required number of
interviewers - and no more - serve at each session and that no interviewer is assigned
to a session for which he is unavailable. Furthermore, each interviewer has a work limit and
cannot be assigned to serve on more sessions than his limit.
Input: Requirements list: a list of positive integers specifying how man interviews are
required for each session.
Resource list: a list containing one element for each interviewer. Each element is a
three-element list containing interviewers name, work limit, and a list of sessions
for which he is unavailable. (Ex [ [white, 2, [1]], [black, 3 []]]).