摘要
在分析排课问题和研究相关算法的基础上,提出了一种基于动态规划和优先级算法的新课程调度算法PCA.根据时间、教室、教师和班级的约束关系,进行等价类划分,依据所设定的优先级次序进行一次性扫描排课,尽量回避对冲突的调整工作,并在此基础上实现了一个课程调度系统,既适应学分制排课要求或满足教师提出较苛刻的上课条件要求,也能在几分钟内做出排课计划.2年的使用实践表明了该系统的有效性和相关算法的高效性.
Processing courses problem and relevant algorithm are studied. New processing courses algorithm （PCA） is introduced based on dynamic programming and precedence algorithm. Considering the restricted relationships of time, classroom, teacher and class, PCA compartmentalizes the different equivalents and processes one off scanned courses by the levels of their precedence, avoiding conflicts adjustment. The PCA system can fulfill the processing course plan in several minutes, even the condition. The application of this system which has been used for two years demonstrates the effectiveness of the system and the high efficiency of its related algorithm.
出处
《武汉理工大学学报（交通科学与工程版）》
2006年第3期485-488,共4页
Journal of Wuhan University of Technology（Transportation Science & Engineering）
基金
湖北省科技厅科技攻关项目资助(批准号:2003AA101CB3)
关键词
排课
动态规划
优先级算法
一次性扫描
学分制
processing courses system
dynamic programming
precedence algorithm
one-off scanning
credit hour system
