Tests on a computer method for constructing school timetables
J. Csima, C. C. Gotlieb · Communications of the ACM · 1964
A previously proposed computer method for constructing timetables, based on an iteration involving Boolean matrices, is described. In limited tests the method has successfully produced timetables on every trial. References are given which relate the timetable problem to theorems on matrices of zeros and ones, and to theorems on bipartite graphs. Some problems of applying the method to constructing timetables in real situations are noted.
Cited by 56 works. doi:10.1145/363958.363986 Open-access PDF
Authors
References
- On Representatives of Subsets
- Theorie Der Endlichen Und Unendlichen Graphen
- An Algorithm for Distinct Representatives
- Combinatorial Properties of Matrices of Zeros and Ones
- Combinatorial Properties of Matrices of Zeros and Ones
- The Construction of Class-Teacher Time-Tables.
- Two Algorithms for Bipartite Graphs
- Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems
- A Geometric Convergence Theorem for the Perceptron
- Matrices Associated With the Hitchcock Problem