Tests on a computer method for constructing school timetables
作者： J. Csima , C. C. Gotlieb
关键词:
摘要: A previously proposed computer method for constructing timetables, based on an iteration involving Boolean matrices, is described. In limited tests the has successfully produced timetables every trial. References are given which relate timetable problem to theorems matrices of zeros and ones, bipartite graphs. Some problems applying in real situations noted.
acm.org
sci-hub.se 参考文章(9)
Dénes König, Theorie Der Endlichen Und Unendlichen Graphen ,(1965)
C. C. Gotlieb, The Construction of Class-Teacher Time-Tables. ifip congress. pp. 73- 77 ,(1962)
Alan G. Konheim, A Geometric Convergence Theorem for the Perceptron Journal of The Society for Industrial and Applied Mathematics. ,vol. 11, pp. 1- 14 ,(1963) , 10.1137/0111001
A. L. Dulmage, N. S. Mendelsohn, Matrices Associated With the Hitchcock Problem Journal of the ACM. ,vol. 9, pp. 409- 418 ,(1962) , 10.1145/321138.321139
J. S. Appleby, Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems The Computer Journal. ,vol. 3, pp. 237- 245 ,(1961) , 10.1093/COMJNL/3.4.237
H. J. Ryser, Combinatorial Properties of Matrices of Zeros and Ones Canadian Journal of Mathematics. ,vol. 9, pp. 269- 275 ,(1957) , 10.1007/978-0-8176-4842-8_18
A. L. Dulmage, N. S. Mendelsohn, Two Algorithms for Bipartite Graphs Journal of The Society for Industrial and Applied Mathematics. ,vol. 11, pp. 183- 194 ,(1963) , 10.1137/0111014
P. Hall, On Representatives of Subsets Journal of The London Mathematical Society-second Series. pp. 26- 30 ,(1935) , 10.1112/JLMS/S1-10.37.26
Marshall Hall, An Algorithm for Distinct Representatives American Mathematical Monthly. ,vol. 63, pp. 716- ,(1956) , 10.2307/2309562