基于SVC的考试时间安排的实现  

Implementation of Examination Timetabling Based on SVC

作　　者：殷玉霞 张彬 帅小应 YIN Yuxia;ZHANG Bin;SHUAI Xiaoying(Library,Taizhou University,Taizhou 225300,China;College of Information Engineering,Taizhou University,Taizhou 225300,China)

机构地区：[1]泰州学院图书馆,江苏泰州225300 [2]泰州学院信息工程学院,江苏泰州225300

出　　处：《微型电脑应用》2022年第8期50-52,共3页Microcomputer Applications

基　　金：泰州学院高层次人才项目(QD2016035);泰州学院本科一流专业建设点(20YLZYB02)。

摘　　要：安排考试工作是一种典型的约束优化调度问题,利用序列点着色与贪心法能有效解决高校教务部门考试安排的困难。学生选修课程间的关系用无向图来表示,课程表示为图中的顶点,被同一位同学选修的两门课程用边连接。按照顶点的度对课程进行降序排序,利用序列点着色方法依次对课程进行考试场次的安排,直到所有课程安排完为止。另外为了增加安排的灵活性,利用搜索方法探索同一门课可能的不同的安排场次。本算法能在尽可能短的考试周期内做好考试安排,缩短考试周期,提高工作效率。Examination timetabling is a typical constrained optimization scheduling problem.The paper proposes analgorithm which uses greedy method and sequential vertex coloring(SVC)to effectively solve the difficult problem of examination arrangement in university.The relationship among students’elective courses is represented by an undirected graph.Courses are represented as vertices in the graph.Two courses selected by the same student are connected by edges.The courses are sorted in descending order according to the degree of the vertex,and the examination timetabling is arranged by the SVC until all the courses are arranged.In addition,in order to increase the flexibility of the arrangement,the search method is used to explore the possible different arrangements for the same course.This algorithm can arrange the examination in the shortest examination period,shorten the examination period and improve the work efficiency.

关 键 词：考试安排 贪心法 序列点着色 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]