| 一种基于完全独立集的排课算法 |
| |
| 引用本文： | 孙波,钟声. 一种基于完全独立集的排课算法[J]. 计算机与数字工程, 2009, 37(8): 22-24,28 |
| |
| 作者姓名： | 孙波 钟声 |
| |
| 作者单位： | 海南职业技术学院信息工程系,海口,570216;海南大学信息科学技术学院,海口,570228 |
| |
| 基金项目： | 海南省教育厅资助项目 |
| |
| 摘 要： | 班级、教师、课程、教室、时间是课表的基本要素,通过把排课转化为求图的完全独立集,解决了时间冲突问题和合班课问题;根据教室资源限制,对独立集的个数和大小进行控制,解决了教室完全匹配问题和一门课程的不同教室安排问题.为实现排课软件提供了一个面向实际的算法.
|
| 关 键 词： | 排课 课表 独立集 匹配 算法 |
Timetable Algorithm Based on Complete Independent Set |
| |
| Sun Bo,Zhong Sheng. Timetable Algorithm Based on Complete Independent Set[J]. Computer and Digital Engineering, 2009, 37(8): 22-24,28 |
| |
| Authors: | Sun Bo Zhong Sheng |
| |
| Affiliation: | Information Engineering Department;Hainan College of Vocation and Technique1;College of Information Science and Technology;Hainan University2 |
| |
| Abstract: | 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 algor... |
| |
| Keywords: | course scheduling timetable independent set matching algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
