Skip Navigation

The Computer Journal 1976 19(4):339-343; doi:10.1093/comjnl/19.4.339
© 1976 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (10)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Aust, R. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An improvement algorithm for school timetabling

R. J. Aust *

Department of Applied Mathematics, University of Adelaide, Adelaide, Australia

This paper describes an algorithm for improving infeasible timetables. It reduces the teaching resource, break and spread infeasibilities in three stages. The first of these involves the solution of a series of capacitated transportation problems and is used when an initial timetable is not given. Under the limitations imposed by actual timetables this stage may be simplified. The other two stages each involve solving a series of small integer programming problems which will be called interchange problems, and they determine the movement of entries within the timetable. Such an algorithm can handle fixed and block meetings, sets, allocation of special rooms and variable teacher availability while producing an acceptable spread of repeated meetings.

Received April 1975.

* Department of Applied Mathematics, University of Adelaide, Adelaide, South Australia 5001, Australia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.