By Topic

A Linear Solution for the University Timetabling Problem

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
$33 $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

3 Author(s)
Maboud Davoudzadeh ; Khalkhal Branch, Islamic Azad Univ., Khalkhal, Iran ; Reza Rafeh ; Roya Rashidi

The university timetabling problem deals with scheduling courses and determining the lecturer and the location of each course in a semester. This problem belongs to NP-hard problems, which means that solving the problem requires smart algorithms. In this paper, we propose a linear formulation of the problem which has been implemented using the GLPG modeling language.

Published in:

Computer and Electrical Engineering, 2009. ICCEE '09. Second International Conference on  (Volume:2 )

Date of Conference:

28-30 Dec. 2009