摘要
在简化的情况下,排课问题可以转化为二分图的边着色问题,但它只解决了教师、班级的排课,未涉及教室问题,离实际应用有很大差距。该文使用扩展的边着色理论,同时考虑教师、班级和教室三者的关系,提出了使用匹配限制着色来解决完整的课表安排问题。
In the simple situation, curriculum arranging schedule can be transformed to an edge coloring model of bipartite graphs, but it only describes the relations of teachers, classes and time, except classrooms, so the model is too simple to solve the practical problem. This paper extends it based on edge coloring through adding the relation of the classroom. The new model can solve the integrated problem.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第3期111-112,115,共3页
Computer Engineering
关键词
排课
边着色
二分图
三分图
curriculum arranging schedule
edge coloring
bipartite graph
three-partite graph
