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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, D.J.: The High School Timetable Construction Problem. Honours Thesis, School of Information Technologies, The University of Sydney (2002)
Christofides, N.: Graph Theory: an Algorithmic Approach. Academic, New York (1975)
Cooper, T.B., Kingston, J.H.: The Solution of Real Instances of the Timetabling Problem. Comput. J. 36, 645–653 (1993)
Cooper, T.B., Kingston, J.H.: The Complexity of Timetable Construction Problems. In: Proc. 1st Int. Conf. Pract. Theory Timetabling, Napier University, Edinburgh (1995)
Cooper, T.B., Kingston, J.H.: A Program for Constructing High School Timetables. In: Proc. 1st Int. Conf. Pract. Theory Timetabling, pp. 283–295. Napier University, Edinburgh (1995)
Cormen, T.H., Leiserson, C.E., Rviest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Csima, J., Gotlieb, C.C.: Tests on a Computer Method for Constructing School Timetables. Commun. ACM 7, 160–163 (1964)
Csima, J.: Investigations on a Time-Table Problem. Ph.D. Thesis, School of Graduate Studies, University of Toronto (1965)
Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5, 691–703 (1976)
Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. J. Comput. Syst. Sci. 9, 256–278 (1974)
König, D.: Graphok es Alkalmazasuk a Determinansok es a Halmazok Elmeletere. Mathematikai es Termeszettudomanyi 34, 104–119 (1916)
Schmidt, G., Ströhlein: Timetable Construction – an Annotated Bibliography. Comput. J. 23, 307–316 (1980)
de Werra, D.: Construction of School Timetables by Flow Methods. INFOR – Can. J. Oper. Res. Inform. Process. 9, 12–22 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abraham, D.J., Kingston, J.H. (2003). Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem. In: Burke, E., De Causmaecker, P. (eds) Practice and Theory of Automated Timetabling IV. PATAT 2002. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45157-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-45157-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40699-0
Online ISBN: 978-3-540-45157-0
eBook Packages: Springer Book Archive