Paper Info
Title
Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem
Abstract
In this paper we introduce a new algorithm for secondary school timetabling, inspired by the classical bipartite graph edge colouring algorithm for basic class-teacher timetabling. We give practical methods for generating large sets of meetings that can be timetabled to run simultaneously, and for building actual timetables based on these sets. We report promising empirical results for one real-world instance of the problem.
Year
DOI
Venue
2002
10.1007/978-3-540-45157-0_19
LECTURE NOTES IN COMPUTER SCIENCE
Keywords
Field
DocType
bipartite graph
Discrete mathematics,Combinatorics,Generalization,Bipartite graph,Timetabling problem,Mathematics
Conference
Volume
ISSN
Citations 
2740
0302-9743
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
David J. Abraham119015.88
Jeffrey H. Kingston233638.79