Research And Realize Of The University Course Arrangement System Algorithm

In order to guarantee its advanced teaching and studying quality, every university mustdraw up a tight and standard teaching and studying plan. The arrangement of curriculumschedule is one of the key questions. Not having a rational, accurate and normal curriculumschedule, the whole university will not has a well teaching and studying order. This showsthe courses arranging is the core of teaching and studying plan. As everyone knows thecourses arranging is a mathematic difficult problem. A lot of people are attracted to study it.Course table problem have also been known as timetable problem, it is the typicalproblem in combination planning, it is also a multi-factor optimization of decision-makingproblems, it is a practical problem that has much research value. Arranging the courses byhand and traditional ways, we have great workload, cost much time, use up many resources,but the accuracy of curriculum schedule is low. . Along with the development ofcomputer, How to use computer to assign timetable becomes a question.Greedy Method is a simplified problem-solving complexity algorithms. Its basic ideais: from an initial solution of a problem, it applied to gradually construct the current state ofthe optimal solution in order to speed as quickly as possible and gradually approaching thegoal of a given search method. Greedy algorithm does not take into account the overall best,but the whole problem into several stages to ensure that at each stage of the optimaldecision to make the present situation, and once the decision-making is no longer changed.Eliminate the use of greedy algorithm to find the overall optimal solution for the exhaust allthe possible amount of time-consuming, and can quickly get a more satisfactory solution.The essence of Course Scheduling algorithm followed by the appropriate curriculumfor all school hours and appropriate courses will take place. If the Course Schedulingprocess of taking class time and class location will make the presentation of Timetablehuge increase rapidly the number of programs, and even give rise to "combinatorialexplosion", in order to avoid this from happening, to simplify the algorithm complexity,Course Scheduling algorithm row Lesson task decomposition timing and place of thearrangements for the two steps. Using successively use twice a greedy selection method,first under the program specified time slice allocation scheme for the program searches thecurrent idle time, the optimal class, curriculum, after school hours to determine, and thensearch the current curriculum to meet the constraints of the optimal school classrooms.The Course Scheduling system has the following characteristics:1. We consulted all automatic course scheduling methods, and read many references,then analyze the mathematical model of Course Scheduling.2. We focused on the requirement analysis in course scheduling, describes the overallstructure of the system. This paper Based on the actual situation, Greedy Method is designed based on a convenient, flexible, fast Course Scheduling System. The systemrealizes the setting of basal information by managing database, Automatically combinedcourse scheduling and manually arranging schedule, greatly increased the speed andaccuracy of Course Scheduling. Course Scheduling The results will ultimately save back tothe database, the output arranging schedule results.3. In each semester course arrangement, it often has some very critical to studentsmust complete to ensure that these special requirements of course with the time and placeof class. In order to ensure that, to avoid re-adjusted after-school end row, you need toadvance before Course Scheduling algorithm runs into the class schedule to arrange theirclass time and class locations. This step can be completed by the Course Schedulingpersonnel manual.4. Course Scheduling task decomposition algorithm for the timing and place ofarrangements for two steps. Using successively use twice a greedy selection method, firstunder the program specified time slice allocation scheme for the program searches thecurrent idle time, the optimal class, curriculum, after school hours to determine, and thensearch the current curriculum to meet the constraints of the optimal school classrooms.5. Algorithm is the allocation of time to establish a program library, arrangingschedule effective way to avoid the problem of "combinatorial explosion" phenomenon,save a lot of time to solve search and to ensure the curriculum in the adjacent schoolbetween the time an appropriate time interval. Giving priority to the training course and thebest school in the course of time, and can meet the teacher's "ban" school hours and the"expectations" school hours, so that Course Scheduling results more scientific and humane.In arranging the classroom, the anxious to ensure efficient use of the classroom, but also tominimize the long-distance transfer of students between classes classrooms.6. In the Course Scheduling process, the first presentation of the course have the mostchoice, with the increasing number of courses have been arranged, followed by row ofcourses to be less and less choice may lead to a number of key curriculum at anunreasonably the time or location. Row sequence of courses on the course schedulingsystem finally finds the optimal solution of the problem as a whole is essential. The CourseScheduling System according to certain rules to seek a priority for each course series, andthen in descending order according to priority, followed by classes for each course to solvethe time and place of class so that you can ensure that important, arranging scheduledifficult give priority to arranging schedule of courses, greatly reducing the CourseScheduling conflicts from arising.7. In order to Course Scheduling results become more rational and scientific as well ashumane, Course Scheduling System in the Course Scheduling process need to give fullconsideration to curriculum, teachers, classes and other elements of the specialrequirements of Course Scheduling. Prior to the Course Scheduling Course SchedulingSystem then allows the user to enter the special requirements of the course arrangement offactors, such as teachers "expect class time" and "Prohibition of class time," programs are"preferred class time" and so on.8. Colleges and Universities Course Scheduling process involves many basic data,these basic data, including faculty, classes, teachers, students, classrooms, curriculum, time,teaching, and some additional information on these basic information to be able to increasebased on the actual situation in a flexible, modify , delete, query and other operations. Basic information management, including: teacher information management, curriculuminformation management, information management, class, classroom informationmanagement.9. After the end of the Course Scheduling, the most important thing is the results ofqueries Course Scheduling, print curriculum, the query feature is the ability to query thecurriculum used in various forms, including by class queries, queries by classroom, byteachers, query, query by time , according to the course a variety of ways to search queries.10. In order to ensure the security of system data, for different types of users to grantpermissions to different operations, according to the different operating privileges displaydifferent information, the operation authority is divided into browsing permissions,arranging schedule entry rights and privileges of three, including browsing the lowestpermission level , then the entry permissions, arranging schedule the highest privilegelevel.