Constructing school timetables using simulated annealing: Sequential and parallel algorithms

Constructing school timetables using simulated annealing: Sequential and parallel algorithms

0.00 Avg rating0 Votes
Article ID: iaor19911582
Country: United States
Volume: 37
Issue: 1
Start Page Number: 98
End Page Number: 113
Publication Date: Jan 1991
Journal: Management Science
Authors:
Keywords: education, optimization
Abstract:

This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number of tuples, each consisting of class of students, a teacher, a subject and a room, to a fixed number of time slots. A Monte Carlo scheme called simulated annealing is used as an optimisation technique. The paper introduces the timetabling problem, and then describes the simulated annealing method. Annealing is then applied to the timetabling problem. A prototype timetabling environment is described followed by some experimental results. A parallel algorithm which can be implemented on a multiprocessor is presented. This algorithm can provide a faster solution than the equivalent sequential algorithm. Some further experimental results are given.

Reviews

Required fields are marked *. Your email address will not be published.