A Simple Heuristic to Facilitate Course Timetabling

Publisher Website
Google Scholar
Abstract
A common class of problem in the area of course timetabling is the scheduling of optional subjects so that each member of the class is able to attend as many as possible of his preferred options without clashes. A simple heuristic framework is described which produces near-optimal solutions very quickly. Various decision rules are tested on actual course data and the best available policies are identified.

This publication has 0 references indexed in Scilit: