The Design And Implementation Of An Automatic Course Scheduling System Based On Greedy Algorithm

With the rapid development of electronic information on technology, information management by computer has been more and more widely used in all professions and trades and various fields. Higher school as the main force and the leader of scientific technology, the application of computer in many aspects of teaching and management and so on is very common. Educational management is a main content of higher school education; it is one of the longest, the most central and the most basic work in the whole school. How to use advanced management methods to organize, command, coordinate and distribute all kinds of teaching resources, and complete the teaching task and goal of education with higher efficiency and higher quality, it is a main subject of routine teaching management.In every aspect of the educational administration management, course scheduling is a very important task. It relates to many factors such as classes, teachers, classrooms, time, course and so on, and is a scheduling problem with multiple objectives. Most college currently is still using backward and traditional artificial class arrangement. It has to need experience in academic staff to arrange the required scheduling classes, classrooms, teachers, time and classes etc. and inevitably modify several times, proofreading again and again to prevent the emergence of conflicts. Such a state is difficult to timely, accurately and efficiently solve the contradiction of teaching resources arrangement. And the course scheduling process is cumbersome and tedious, time-consuming and laborious.In this paper, through comparison of several popular courses scheduling algorithm, combined with the actual needs of specific, I choose the greedy algorithm as the scheduling algorithm of the project. This paper presents a kind of greedy algorithm based on lookup strategy grouping by priority to solve the problem with complex conditions. The algorithm looks the accommodating number of the classroom and available time together as a kind of available resources, groups the resources by the function of the classroom, sorts the resources in accordance with the time and the student number. And then we look the course of applying classroom as the resource requester, judging by the reasonable conditions for resources, searching for the right teaching resource allocation. Such a method not only achieves the efficiency optimization of scheduling, but also maximizing the availability of the scheduling results.