作　　者： ; ; ;

机构地区： 广东技术师范学院计算机科学学院

出　　处： 《信息技术》 2008年第7期173-176,共4页

摘　　要： 目前有许多研究排课算法的专业书籍、论文,其涉及的解决方案有基于图的树遍历算法、基于概率的随机算法、基于基因理论的遗传算法等。运用计算机进行自动排课既是高校教务管理的迫切需要,同时也有重要的理论意义,但由于排课问题复杂多变,几十年来还没有定型的最优实现方案。运用优先级的贪婪算法,设计并实现了一种基于优先级的贪婪算法的排课系统。 At present, there are many professional books and papers for the research of the Course Scheduling Algorithm. The solutions involved in are the Tree Traversal Algorithm based on the graph, the Random Algorithm based on the probability, the Heredity Algorithm based on the theories of gene, etc. Not only is the use of computers for the automatic course scheduling in urgent need by the college educational administration, but also it owns an important theoretical significance. But since the problems of Course Scheduling are complex and changeable, a steady optimal project has not been carried out for several decades. This paper will use the Preferential Greedy Algorithm to design and realize a Course Scheduling System based on the Preferential Greedy Algorithm.

关 键 词： 排课算法 贪婪算法 排课系统

领　　域： [自动化与计算机技术] [自动化与计算机技术]