College Course Scheduling Software Research And Development

The arranging schedule is one of the most important and complicated job in a school. The essential is arranging the time and place for every class in order that whole teaching will be carried on orderly. With the development of the IT, the request of arranging schedule by computer is very urgent, but there is no universal arranging schedule system that have been accepted by the masses. Some people a regard the arranging schedule as the question of integral programming, but the calculative scale is very great, there is no a suitable arithmetic to solve it. The others manage to use the painted theory of chart to solve it, but that is also a NP complete question. Many arranging schedule systems use the heuristic function to do with it. But it will be disturbed by many man-made factors. In a word, these arranging schedule systems have their own virtues and faults, it will be limited by the educational system of a school,the universal capability is not very strong.This thesis studies how to solve the knapsack problem comparatively and thoroughly by using greedy algorithm on the base of analysis and integration on the document and method related to course schedule arranging technique at home and abroad, drawing their merits and simplifying course arranging problem into a knapsack problem. The author developed the schedule arranging system of higher vocational schools by introducing Greedy Algorithm into Course Schedule Arranging System and giving out the core calculates method.We have arranged the class tables of six terms by this system in our school, and have done the same thing in another type of school, the class tables is checked by the educational administration department and this system is suitable. The theory used in this article is significant in developing the universal and applied arranging schedule system.