Academic course scheduling by simulated annealing

Authors:
Jared J. Nelson;Ivan Craddock;Kosuke Imamura
Affiliations:
Eastern Washington University, Cheney, WA;Eastern Washington University, Cheney, WA;Eastern Washington University, Cheney, WA
Venue:
Journal of Computing Sciences in Colleges
Year:
2013

Citing 3
Cited 0

A Comparison of Annealing Techniques for Academic Course Scheduling

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
An application of genetic algorithms to the school timetabling problem

Proceedings of the 2008 annual research conference of the South African Institute of Computer Scientists and Information Technologists on IT research in developing countries: riding the wave of technology
A simulated annealing algorithm with a new neighborhood structure for the timetabling problem

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We developed software to solve an academic course scheduling problem. A feasible solution to this problem allocates available instructional resources, such as instructors, classrooms, labs, and day/hours without conflicts. Course scheduling is a well-known NP complete timetabling problem. We used simulated annealing, which is often used to approximate solutions to problems of combinatorial explosion. We tested the software on data provided by our computer science department and the result is promising for practical use.