In this paper, we focus on solving problems modeled after a real-world
high school timetable problem. It includes multiple objectives and a
variety of constraints. It mainly involves producing an optimal schedu
le for each teacher and for each class. The conventional integer progr
amming approach seems to have some difficulties with solving such prob
lems. The versatility of our proposed heuristic based on a modificatio
n of the threshold accepting method is exemplified through our problem
solving. For comparison sake, simulated annealing was also used to so
ke the same problems.