The Research And Application Of Greedy Algorithm Based On The Time Slice Priority Scheduling Algorithm

As information technology continues to evolve,more and more areas of computer applications.As the most important university teaching job scheduling,arranging work from the traditional manual Timetable Timetable turned to the use of computer.However,the success rate is currently arranging a computer is not high.Scheduling software how to improve the success rate of software is being scholars and technical staffs attention.Timetable scheduling problem is essentially a time,teachers,classes,classrooms,curriculum conflict between this five-dimensional NP-complete problem.This paper first approximation algorithm to solve the problem to start arranging for analysis,such as dynamic programming,backtracking,greedy algorithm to find an algorithm to solve the course scheduling problems based innovatively proposes a greedy algorithm and time-priority algorithm greedy algorithm based on the integration of the time-slice priority Scheduling algorithms.Focus on describing and comparing the current popular method based on dynamic programming Automated Course Scheduling algorithm,based on the priority Timetable backtracking algorithms,and proposed and studied in this paper based on the greedy algorithm of the time slice Priority Scheduling algorithms.Automatic Scheduling algorithm based search is centered curriculum match,taking the first matching value,the data did not merit selection,it is not rational allocation of resources for teaching,can not meet some special requirements(for example,some teachers in favor of a centralized school some curriculum will be more appropriate to the morning,etc.).Priority Scheduling algorithms are mainly from the settling time,teachers,classes,classrooms,a conflict between this four-dimensional relationship to start,classroom by classroom and classified according to the time schedule array of teachers,classrooms,classroom curriculum,some special requirements for the course can not reflect the.The greedy algorithm based on the time slice priority Scheduling algorithms for time,teacher,classroom,class,curriculum this five-dimensional relationship between the conflict,according to the time slice priority to solve the teachers,classes,classrooms,conflicts between courses,not only for teaching resources can be allocated more rationally,but also to meet some special requirements when arranging the discharged curriculum is reasonable.From arranging the success rate,accuracy and efficiency of the algorithm to analyze the greedy algorithm based on time priority Scheduling Scheduling algorithm is superior to the other algorithms.Finally,the author's work unit Hunan Vocational and Technical College,for example,will be studied in this paper and the proposed greedy algorithm based on time slice priority Scheduling algorithm is applied to specific examples---Training Resource Management System,a detailed description of the system from the algorithm analysis to system design,to function modules design and development process,based on the greedy algorithm of the time slice priority Scheduling algorithm for Scheduling problem application provides a strong case to support.