Tests on a computer method for constructing school timetables
- 1 March 1964
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 7 (3) , 160-163
- https://doi.org/10.1145/363958.363986
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- A Geometric Convergence Theorem for the PerceptronJournal of the Society for Industrial and Applied Mathematics, 1963
- Matrices Associated With the Hitchcock ProblemJournal of the ACM, 1962
- Techniques for Producing School Timetables on a Computer and their Application to other Scheduling ProblemsThe Computer Journal, 1961
- Combinatorial Properties of Matrices of Zeros and OnesCanadian Journal of Mathematics, 1957
- An Algorithm for Distinct RepresentativesThe American Mathematical Monthly, 1956