Study on intelligent course scheduling system

Abstract

Course scheduling is a challenge task in the teaching process, which highly related with the quality of university. Given the number of the class rooms and time range, the aim of the algorithm is to arrange proper time and place to make sure there is no conflict. Usually, this kind of algorithms is NP-complete problem, and takes a lot of time to find the exact solution. To improve the speed and the quality, we propose a time searching algorithm consisting of three steps: initial, bottom-up and up- bottom. In order to speed the nearest capacity classroom searching, we also incorporate an equivalence class division algorithm. Besides, we provide a well-designed interactive interface to make the course scheduling more simple and flexible.