The Study On Automatic Course Arrangement Algorithm Based On Classification Optimization And Priority

With the rapid development of our educational cause and the increment of students, artificial courses-arraying far already can not adapt to the new situation. On the other hand, in today's fast development of computer, computer has become an extremely indispensable part of college education and management. Software has been of more and more application in all part of school, for instance, student management, performance management, materials management, etc. In recent years, many schools have been hoping to complete the arrangement of the complex and tedious task by means of computer, but they could not find a kind of fast, reasonable algorithm to solve the problem.The algorithm based on optimization and priority is proposed in this thesis. Firstly, the class period, course and classroom are classfied and optimizated in the algorithm. Then we use priority algorithm combining matrix matching to achieve automatic course arrangement. The proposed algorithm overcomes the difficulties from many factors, more and more constraints.The thesis is divided into four parts.In the first part, we introduce the curriculum teaching management firstly, secondly introduces the importance of the problem after the achievements of the course and problems are detailed narrated; then discusses the significance of using a computer course; then presents the existing methods for course-arraying, and then analyzes their advantages and disadvantages; finally the main research contents and main characteristics are briefly summarized.The second part overviews simply the development platforms which can be used for course-arraying systems, and describes in detail the SQL Server 2005 which is chosen as our platform.The third part studies the basic principle for scientific arrangement and lists the various factors and involved problems. Furthermore, we analyze the functional requirements, data demand and database demand in the course-arraying system to be developed.The fourth part discusses in detail the priority-based course arrangement algorithm. We list the various constraint conditions involved in the course arrangement and formulate the mathematical model which can be identified by computer. We then describe the priority and rationality of the proposed algorithm. Moreover, we describe the present scheme in more detailed manner, and plot the relative flow charts. Finally, we point out the remaining problems to be deal with the late stage.