|
|||||
|
|
| 高校排考问题中时间点安排方法的研究 | |
| 引用本文： | 姚徐,姚双良,孙惠琴. 高校排考问题中时间点安排方法的研究[J]. 数字社区&智能家居, 2011, 0(13) |
| 作者姓名： | 姚徐 姚双良 孙惠琴 |
| 作者单位： | 江苏科技大学教务处; |
| 摘 要： | 为了解决高校灵活多样地选课带来的排考问题,在以往以班级为单位的排考基础上,结合高校实际情况进行分析和拓展,提出了一种新的排考问题中时间点的安排算法。该算法易实现且计算效率高,有效地解决此类排考中的问题。 |
| 关 键 词： | 排考 冲突 算法 |
Algorithm for Arranging Time Number of the Exam-arrangement Problem in Universities |
|
| YAO Xu,YAO Shuang-liang,SUN Hui-qin. Algorithm for Arranging Time Number of the Exam-arrangement Problem in Universities[J]. Digital Community & Smart Home, 2011, 0(13) | |
| Authors: | YAO Xu YAO Shuang-liang SUN Hui-qin |
| Affiliation: | YAO Xu,YAO Shuang-liang,SUN Hui-qin(Dean's Office,Jiangsu University of Science and Technology,Zhenjiang 212003,China) |
| Abstract: | To solve the problem of arranging the exam-arrangement which is difficult due to its uncontrollable randomization,a new algorithm based on the previous way and combined with college actual situation is proposed.It is proved that the algorithm is effective and its time complexity is simple. |
| Keywords: | arranging time number of examination collision algorithm |
| 本文献已被 CNKI 等数据库收录！ | |