基于贪心算法的自动排课方法研究  

The Research on the Method of Automatic Curriculum Scheduling based on Greedy Algorithm

作　　者：刘丹 Liu Dan(School of Big Data and Computer Science,Guizhou Normal University,Guiyang Guizhou 550001,China)

机构地区：[1]贵州师范大学大数据与计算机科学学院,贵州贵阳550001

出　　处：《信息与电脑》2020年第4期36-38,共3页Information & Computer

摘　　要：针对当前中小学排课问题中存在的软硬约束多、冲突难解决的众多问题,笔者提出一种基于贪心算法的实现方法,它与部分优先度排序的思想结合,在排课开始前根据设定的约束条件对课程和班级进行排序,利用排序结果依次进行排课。经过实验证明,该方法在处理中小学自动排课问题时取得不错的效果。In view of the current problems in primary and secondary school curriculum arrangement,such as many soft and hard constraints and many conflicts,the author proposes an implementation method based on the greedy algorithm,which combines with the idea of partial priority ranking,sorts the courses and classes according to the set constraints before the beginning of curriculum arrangement,and then arranges the courses in order by using the sorting results.The experimental results show that this method has a good effect in dealing with the problem of automatic scheduling in primary and secondary schools.

关 键 词：贪心算法 优先度排序 自动排课 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]