Abstract:

The timetabling problem is a multifactor optimized decision problem and is typical problem in constitution and planning. It has been proved to be a NPcomplete problem. In order to restrain the phenomenon of combination explosion of course scheduling and improve the course scheduling rate, according to the characteristics  of course assignment in universities, this paper proposes the concept of time pattern for the discrete and distributed weekly class hours and devises the time greedy criterion and classroom greedy criterion. The test results show that our algorithm can not only simplify the process and improve the efficiency for course scheduling, but also improve the satisfaction with timetabling.

Key words: course scheduling；time pattern；greedy criterion