Skip to main content Accessibility help
×
Home

On the Gotlieb-Csima Time-Tabling Algorithm

  • M. A. H. Dempster (a1)

Extract

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.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      On the Gotlieb-Csima Time-Tabling Algorithm
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      On the Gotlieb-Csima Time-Tabling Algorithm
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      On the Gotlieb-Csima Time-Tabling Algorithm
      Available formats
      ×

Copyright

References

Hide All
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).
2. Csima, J. and Gotlieb, C. C., Tests on a computer method for constructing school time-tables, Comm. ACM, 8 (1965), 160163.
3. Dempster, M. A. H., Two algorithms for the time-table problem (to appear).
4. Gotlieb, C. C., The construction of class-teacher time-tables, Proc. I.F.I.P. Congress 62, Munich (Amsterdam, 1963), pp. 7377.
5. Lions, J., Matrix reduction using the Hungarian algorithm for the generation of school timetables, Comm. ACM, 9 (1966), 349354.
6. Lions, J., A counter-example for Gotlieb's Method for the construction of school timetables, Comm. ACM, 9 (1966), 697698.
7. Lions, J., The Ontario school scheduling program, Comput. J., 10 (May, 1967), 1421.
8. Ryser, H. J., Combinatorial mathematics, Carus Math. Monographs No. 14 (New York, 1963).
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed