By Topic

Constructing university timetable using constraint satisfaction programming approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhang, L. ; Inf. Syst. Discipline, Wollongong Univ., NSW ; Lau, S.K.

The timetabling problem consists of a set of subjects to be scheduled in different timeslots, a set of rooms in which the subjects can take place, a set of students who attend the subjects, and a set of subjects satisfied by rooms and required by timeslots. The heart of the problem is the constraints that exist as regulations within each resource and between resources. There are various solution approaches to solve the timetabling problem. This paper focuses on developing a constraint satisfaction problem model for a university timetabling problem. A solution of a constraint satisfaction problem is a consistent assignment of all variables to values in such a way that all constraints are satisfied. A sample case study problem is investigated and a constraint satisfaction programming approach is implemented using ILOG scheduler and ILOG solver. We use various goals in ILOG to investigate the performance of the CSP approach

Published in:

Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, International Conference on  (Volume:2 )

Date of Conference:

28-30 Nov. 2005