一种面向智能排考的最优时段“净化”方法

摘要

针对各类排考资源在空闲时间段上的最优匹配问题,根据考试编排的约束条件,从时间选择算法的构建、着色、数据结构描述以及可用时间段的选择,最优时间段的形成等方面进行算法描述,并给出算法的具体步骤和流程图.实验结果表明,经“净化”处理后的最优时间段匹配算法能有效解决排考过程中的约束问题,避免排考过程中的人为干预,而且具有较好的灵活性和简洁性.%To realize optimal matching of the various arrangement examination resources (such as teaching classes,courses,teachers,classrooms,etc.) on the idle time,first,the resources which are required by arrangement examination process were described.Then,to aim at the optimal matching problems for all kinds of exam-arrangement resources,some algorithm descriptions were achieved according to the constraint condition of the exam choreography,which were from designing,coloring,and description of data structure of the time selection algorithm,from choice of free time period,and from formation of the optimal time period.Then,the specific steps and flowchart of the algorithms were given.Experiment results show that the purified optimal period matching algorithm can effectively solve the bound problem of the arrangement examination process,and avoid human intervention in the arrangement examination process.Furthermore,it has good flexibility and simplicity.