Tests on a computer method for constructing school timetables

Authors:
J. Csima;C. C. Gotlieb
Affiliations:
Hydro Electric Power Commission of Ontario, Toronto, Canada;Univ. of Toronto, Toronto, Canada
Venue:
Communications of the ACM
Year:
1964

Citing 1
Cited 12

Matrices Associated With the Hitchcock Problem

Journal of the ACM (JACM)

Metaheuristics for High School Timetabling

Computational Optimization and Applications
Some Results Concerning the Reduction of Binary Matrices

Journal of the ACM (JACM)
Matrix reduction—an efficient method

Communications of the ACM
On maintenance of the opportunity list for class-teacher timetable problems

Communications of the ACM
Letters to the editor: a reaction to Juncosa's proposal for ACM publications

Communications of the ACM
Letters to the editor: further results on computer construction of school timetables

Communications of the ACM
Remarks on computer program for the construction of school timetables

Communications of the ACM
Comments on professor Tewarson's letter

Communications of the ACM
On CR review 8570

Communications of the ACM
“Algorithm” and “formula”

Communications of the ACM
On facilitating parallel and multiprocessing in ALGOL

Communications of the ACM
On the problem of time table construction

Communications of the ACM

Quantified Score

Hi-index	48.37

Visualization

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.