A university course timetabling problem

J.M. Phala


This paper addresses a university course timetabling problem. The problem as experienced at Unibo is formulated in such a way that simple heuristics can be used to achieve the objective of finding either an 'optimal' or a feasible practical solution. the problem is divided into three phases, namely grouping of courses into course groups, allocation of lecture rooms to courses within groups, and finally, scheduling of periods to course groups. Heuristic algorithms are proposed to solve this problem. The computerised algorithms which have been integrated into Unibo's Student Management System are fully implemented.

Full Text:


DOI: https://doi.org/10.5784/4-2-487


  • There are currently no refbacks.

ISSN 2224-0004 (online); ISSN 0259-191X (print)

Powered by OJS and hosted by Stellenbosch University Library and Information Service since 2011.


This journal is hosted by the SU LIS on request of the journal owner/editor. The SU LIS takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.

SUNJournals Help