Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T19:43:52.882Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Gotlieb-Csima Time-Tabling Algorithm

Published online by Cambridge University Press:  20 November 2018

M. A. H. Dempster
M. A. H. Dempster*
Affiliation:
Balliol College, Oxford University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper concerns an algorithm, proposed by C. C. Gotlieb (4) and modified by J. Csima (1; 2), for a recent combinatorial problem whose application includes the construction of school time-tables. Theoretically, the problem is related to systems of distinct subset representatives, the construction of Latin arrays, the colouring of graphs, and flows in networks (1; 2; 3). I t was conjectured by Gotlieb and Csima that if solutions to a given time-table problem existed, i.e. if time-tables incorporating certain pre-assigned meetings existed, their algorithm would find one.

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 20 , 1968, pp. 103 - 119
Copyright
Copyright © Canadian Mathematical Society 1968

References

1. Csima, J., Investigations on a time-table problem, Doctoral dissertation, (issued as a report of the Institute of Computer Science), Univ. of Toronto (1965).Google Scholar
2. Csima, J. and Gotlieb, C. C., Tests on a computer method for constructing school time-tables, Comm. ACM, 8 (1965), 160–163.Google Scholar
3. Dempster, M. A. H., Two algorithms for the time-table problem (to appear).Google Scholar
4. Gotlieb, C. C., The construction of class-teacher time-tables, Proc. I.F.I.P. Congress 62, Munich (Amsterdam, 1963), pp. 73–77.Google Scholar
5. Lions, J., Matrix reduction using the Hungarian algorithm for the generation of school timetables, Comm. ACM, 9 (1966), 349–354.Google Scholar
6. Lions, J., A counter-example for Gotlieb's Method for the construction of school timetables, Comm. ACM, 9 (1966), 697–698.Google Scholar
7. Lions, J., The Ontario school scheduling program, Comput. J., 10 (May, 1967), 14–21.Google Scholar
8. Ryser, H. J., Combinatorial mathematics, Carus Math. Monographs No. 14 (New York, 1963).10.5948/UPO9781614440147CrossRefGoogle Scholar