Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms

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.

• 저널Management Science · 37(1) · 98–113
• 토픽Real-Time Systems Scheduling · Hardware and Architecture
• DOI10.1287/mnsc.37.1.98
• 저자David Abramson