Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem
- 925 Downloads
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.
KeywordsTime Slot Bipartite Graph Student Group Edge Colouring English Teacher
Unable to display preview. Download preview PDF.
- 1.Abraham, D.J.: The High School Timetable Construction Problem. Honours Thesis, School of Information Technologies, The University of Sydney (2002)Google Scholar
- 4.Cooper, T.B., Kingston, J.H.: The Complexity of Timetable Construction Problems. In: Proc. 1st Int. Conf. Pract. Theory Timetabling, Napier University, Edinburgh (1995)Google Scholar
- 5.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)Google Scholar
- 8.Csima, J.: Investigations on a Time-Table Problem. Ph.D. Thesis, School of Graduate Studies, University of Toronto (1965)Google Scholar
- 11.König, D.: Graphok es Alkalmazasuk a Determinansok es a Halmazok Elmeletere. Mathematikai es Termeszettudomanyi 34, 104–119 (1916)Google Scholar
- 13.de Werra, D.: Construction of School Timetables by Flow Methods. INFOR – Can. J. Oper. Res. Inform. Process. 9, 12–22 (1971)Google Scholar