| 课程表编排问题的算法研究 |
| |
| 引用本文： | 王秋芬,袁东锋. 课程表编排问题的算法研究[J]. 计算机与现代化, 2012, 0(3): 19-22 |
| |
| 作者姓名： | 王秋芬 袁东锋 |
| |
| 作者单位： | 南阳理工学院计算机科学与技术系 |
| |
| 摘 要： | 研究课程表编排问题的约束条件及相关算法,提出一种混合编排算法。此算法可根据教室、教师、时间和班级的约束关系,根据所设定的优先级顺序完成排课,尽量避免冲突并调整冲突,能够更好地应对多样化的排课需求。
|
| 关 键 词： | 课程表 时间规划 算法 优先级 |
Algorithm Study of Curriculum Arrangement Problem |
| |
| WANG Qiu-fen,YUAN Dong-feng. Algorithm Study of Curriculum Arrangement Problem[J]. Computer and Modernization, 2012, 0(3): 19-22 |
| |
| Authors: | WANG Qiu-fen YUAN Dong-feng |
| |
| Affiliation: | (Department of Computer Science and Technology,Nanyang Institute of Technology,Nanyang 473004,China) |
| |
| Abstract: | This paper studies constraint conditions and related algorithms of the curriculum arrangement seriously,proposes an algorithm composed by many single algorithms.According to preferential order and the constraint relationship among classrooms,teachers,time and classes,the algorithm can arrange courses by scanning.It tries its best to avoid conflicts and adjusts the conflicts.So,it can cope with the diverse needs of the course scheduling. |
| |
| Keywords: | curriculum timetable time planning algorithm priority |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
