The Research on Multi-Strategy Course Scheduling Algorithm

The timetabling problem is a NP-complete problem which has been committed to finding a solution by the field of operations research and computer but has not got a good solution. The timetabling is the most important problem in the course scheduling. With the development of disciplines, the change of the size and direction of enrollment, increasing the difficulty of the Course Scheduling. This paper raised a Multi-strategy Course Scheduling Algorithm which based on Greedy Algorithm, Genetic Algorithm and Taboo Search, in order to effectively alleviate the shortage of classroom resources, time conflicts and other issues. The experimental results show that this method is feasible and effective.