Analysis and design of algorithm for courses scheduling system

The usable time sets, the timeout of optimization, free classrooms, classrooms of optimization and algorithms for resolving the conflicts in the course searching involved in the courses scheduling system are discussed. The former four taches mainly involve in the searching for time and classroom sets and choosing the optimization match according to some optimum strategy. The last tache is to adjust conflicts by the deep-first graphic searching in the artificial intelligence.