Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem

  • David J. Abraham
  • Jeffrey H. Kingston
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2740)


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.


Time Slot Bipartite Graph Student Group Edge Colouring English Teacher 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abraham, D.J.: The High School Timetable Construction Problem. Honours Thesis, School of Information Technologies, The University of Sydney (2002)Google Scholar
  2. 2.
    Christofides, N.: Graph Theory: an Algorithmic Approach. Academic, New York (1975)zbMATHGoogle Scholar
  3. 3.
    Cooper, T.B., Kingston, J.H.: The Solution of Real Instances of the Timetabling Problem. Comput. J. 36, 645–653 (1993)CrossRefGoogle Scholar
  4. 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. 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
  6. 6.
    Cormen, T.H., Leiserson, C.E., Rviest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)zbMATHGoogle Scholar
  7. 7.
    Csima, J., Gotlieb, C.C.: Tests on a Computer Method for Constructing School Timetables. Commun. ACM 7, 160–163 (1964)zbMATHCrossRefGoogle Scholar
  8. 8.
    Csima, J.: Investigations on a Time-Table Problem. Ph.D. Thesis, School of Graduate Studies, University of Toronto (1965)Google Scholar
  9. 9.
    Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5, 691–703 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. J. Comput. Syst. Sci. 9, 256–278 (1974)zbMATHCrossRefGoogle Scholar
  11. 11.
    König, D.: Graphok es Alkalmazasuk a Determinansok es a Halmazok Elmeletere. Mathematikai es Termeszettudomanyi 34, 104–119 (1916)Google Scholar
  12. 12.
    Schmidt, G., Ströhlein: Timetable Construction – an Annotated Bibliography. Comput. J. 23, 307–316 (1980)CrossRefMathSciNetGoogle Scholar
  13. 13.
    de Werra, D.: Construction of School Timetables by Flow Methods. INFOR – Can. J. Oper. Res. Inform. Process. 9, 12–22 (1971)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • David J. Abraham
    • 1
  • Jeffrey H. Kingston
    • 1
  1. 1.School of Information TechnologiesThe University of SydneySydneyAustralia

Personalised recommendations