z-logo
open-access-imgOpen Access
Extensions to the heuristic algorithm for University timetables
Author(s) -
A. Yule
Publication year - 1968
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/10.4.360
Subject(s) - heuristic , computer science , mathematical optimization , operations research , null move heuristic , algorithm , artificial intelligence , mathematics
An alternative method of data handling in the heuristic algorithm for University timetables is suggested and methods of including various constraints on the final solution are given. The extended algorithm includes the allocation of suitable rooms to lectures, the consideration of lecturers' preferences, dynamic allocation of a lecturer's free day, and the spreading of similar lectures over the week.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom