A graph edge colouring approach for school timetabling problems
by Rakesh P. Badoni; D.K. Gupta
International Journal of Mathematics in Operational Research (IJMOR), Vol. 6, No. 1, 2014

Abstract: School timetabling problems require weekly scheduling of lectures for subjects between teachers and classes in fixed time periods such that a set of constraints are satisfied. In this paper, a school timetabling problem is solved using a graph edge colouring algorithm in two phases. A bipartite multigraph is used in the first phase to get daily requirement matrices for each day of the week from weekly requirement matrix obtained by solving a system of linear equations for the variables taking integer values. Next, bipartite graphs are used in the second phase to assign lectures over unconstrained time slots for each day. The algorithm is tested on a number of randomly generated data sets and a timetable for a simple data set is given. The performance of the algorithm measured in terms of the number of iterations required and amount of CPU time in seconds is summarised in a table.

Online publication date: Sat, 28-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com