Thumbnail
Access Restriction
Subscribed

Author Hoare, C. A. R. ♦ Johnston, H. C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Structured programming ♦ Tight set ♦ Matrix reduction ♦ Binary matrices ♦ School timetable construction
Abstract The paper describes an efficient method for reduction of the binary matrices which arise in some school time-tabling problems. It is a development of that described by John Lions. It has been generalized and adapted to fit into the complete timetabling process; to use a more compact data representation and more efficient processing techniques; to take fuller advantage of possible available previous knowledge about the matrix. And it is designed as a structured program, which can readily be coded by the reader in the high level or low level programming language of his choice. Practical tests of the method have shown it to be a good basis for a realistic timetabling algorithm.
Description Affiliation: Queen's Univ. of Belfast, Belfast, Northern Ireland (Johnston, H. C.; Hoare, C. A. R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 18
Issue Number 3
Page Count 10
Starting Page 141
Ending Page 150


Open content in new tab

   Open content in new tab
Source: ACM Digital Library