摘要
课程表的编排是高校教务管理中最为重要和复杂的一项工作。通过对几种自动排课算法的合理比较,统筹分析出各自的优劣,得出贪婪算法的综合适用性是最优的结论。在此基础之上,进一步分析贪婪算法是如何逐步解决排课的现实问题,并给出基于贪婪算法的自动排课系统算法的具体实现过程。
Course arrangement is one of the most important and complex work in the university educational management. Compares and analyzes several algorithms in course arrangement carefully, and draws a conclusion that greedy algorithm is more suitable for comprehensive ap- plicability. Further analyzes of the greedy algorithm that how to gradually solve practical problems in arranging courses and presents the implementation process in scheduling system based on greedy algorithm.
基金
西华师范大学大学生科技创新基金项目(No.42713063)
关键词
自动排课
贪婪算法
遗传算法
回溯算法
算法复杂度
Automatic Courses Arrangement
Greedy Algorithm
Genetic Algorithm
Back-Track Algorithm
Algorithm Complexity
