Various formulations of timetabling problems are given in terms of col
oring problems in graphs. We consider a collection of simple class-tea
cher timetabling problems and review complexity issues for these formu
lations. This tutorial presentation (which is not claimed to be an exh
austive review nor a research contribution) includes a brief sketch of
a tabu search procedure which handles many specific requirements and
provides an efficient heuristic technique.