论文信息 - Tests on a computer method for constructing school timetables

Tests on a computer method for constructing school timetables

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.

Calvin C. Gotlieb | J. Csima | C. Gotlieb | J. Csima

[1] N. S. Mendelsohn,et al. Two Algorithms for Bipartite Graphs , 1963 .

[2] D. Koenig. Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[3] N. S. Mendelsohn,et al. Matrices Associated With the Hitchcock Problem , 1962, JACM.

[4] P. Hall. On Representatives of Subsets , 1935 .

[5] E. A. Newman,et al. Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems , 1961, Comput. J..

[6] A. Konheim. A Geometric Convergence Theorem for the Perceptron , 1963 .

[7] Calvin C. Gotlieb,et al. The Construction of Class-Teacher Time-Tables , 1962, IFIP Congress.

[8] H. Ryser. Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[9] Marshall Hall,et al. An Algorithm for Distinct Representatives , 1956 .

[10] L. Vietoris. Theorie der endlichen und unendlichen Graphen , 1937 .