摘要
班级、教师、课程、教室、时间是课表的基本要素,通过把排课转化为求图的完全独立集,解决了时间冲突问题和合班课问题;根据教室资源限制,对独立集的个数和大小进行控制,解决了教室完全匹配问题和一门课程的不同教室安排问题。为实现排课软件提供了一个面向实际的算法。
The classes, teachers, courses, classrooms, time are essential elements of a timetable. Transforming the timetable to complete independent sets resolves the time conflict. According to the classroom resource constraints, the number of independent set and size to control and resolves the matching the classroom entirely and the different classrooms arrangements of one course. At the same time, follow-up question the reasonableness of a brief analysis and pointed out the direction. It provides a practical-oriented algorithm for the Timetable software.
出处
《计算机与数字工程》
2009年第8期22-24,28,共4页
Computer & Digital Engineering
基金
海南省教育厅资助项目(编号:Hj2008-139)资助
关键词
排课
课表
独立集
匹配
算法
course scheduling, timetable, independent set, matching, algorithm
