Font Size: a A A

Research And Design On System Of Automatic Course Arrangement Based On Priority

Posted on:2012-06-28Degree:MasterType:Thesis
Country:ChinaCandidate:Z Y ZhouFull Text:PDF
GTID:2178330335969393Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
Course Scheduling, namely, arangement of curriculum schedule currently which is one of the problems of information processing receives much concern. It is a multi-objective decision optimization problem, because many factors, a great amount of data and many conplex constrants are involved in course scheduling, by using the traditional manual arrangement of curriculum schedule, the speed,rationality and scientificity of its result can not be guaranteed. With computers'extensive application on information processing problems and the enrichment and complement of our college curriculum system, useing computer to assist with course arrangement becomes a trend. Currently, the existing university course scheduling systems play their role in a few universities, but due to arangement of curriculum schedule is a NP problem and because of different universities with different practical situation and needs, developing a universal system meeting with different needs is a hard work.The paper first considers teaching reality of Central China Normal University(CCNU),then it analyzes fundamental problems of course scheduling, discusses merits and faults of the present common course scheduling algorithm, based on the fact of taking external teaching site as a unit to fit elective system of the university, it researches and designs a new course scheduling algorithm. The algorithm first sets priorities of external teaching sites,then arranges them by priorities for reducing and avoiding sites conflicts. When arranging a site, we use circulation algorithm thinkings to reach goal of reducing the complexity of the problem, first arrange class time,then arrange classroom.This algorithm is combined with greedy algorithm by setting different timed modes priorites, while aranging class time,always matching with the highest priority mode first in order to receive the best teaching effect. By considering using teaching resourses reasonably, it devides classrooms to several parts, chooses proximal capacity when arranges classroom. The algorithm is also combined with backtracking method to deal with part of deadlock problems. Whereafter, the paper introduces course scheduling system design and implementation. Faced with time deadlock problem,it gives several kind of feasible solutions and designs an interactive manual course scheduling surface which reduces workload of academic staff and deals with difficulties much more efficient than manual scheduling which use experience only. Currently,the course scheduling system is basically completed and is now in operating cycle. By testing the system, it shows that the system functions well and is with good response time.
Keywords/Search Tags:Course Scheduling Algorithm, Priority, External Teaching Sites, Deadlock, Course Scheduling System
PDF Full Text Request
Related items