摘要
高校期末排考中的场次分配,要求在满足约束的前提下,用尽量少的场次安排所有的课程考试。将场次分配问题转换为带权顶点最小着色问题求解,给出一种贪心算法及其SQLServer上的具体实现,包括设计数据库、预处理、分配、检查结果等四个步骤。
The batching scheduling in the term examination in universities requires that all courses be arranged into as few places as possible with constraints. The problem is transformed into the problem of minimum coloring of weighted vertices. Presents a greedy algorithm and its im. plementation on SQL Server, including four steps: designing database, preprocessing, assigning and checking results.
作者
袁子昂
YUAN Zi-ang(School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou 310018)
出处
《现代计算机》
2019年第16期78-81,共4页
Modern Computer
