课程表编排问题的算法研究

Algorithm Study of Curriculum Arrangement Problem

研究课程表编排问题的约束条件及相关算法,提出一种混合编排算法。此算法可根据教室、教师、时间和班级的约束关系,根据所设定的优先级顺序完成排课,尽量避免冲突并调整冲突,能够更好地应对多样化的排课需求。

This paper studies constraint conditions and related algorithms of the curriculum arrangement seriously, proposes an al- gorithm 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 con- flicts. So, it can cope with the diverse needs of the course scheduling.