提高学生满意度的考试时段调度算法

Ye Rim Han, Min Joon Cho, Jae Sook Kim
{"title":"提高学生满意度的考试时段调度算法","authors":"Ye Rim Han, Min Joon Cho, Jae Sook Kim","doi":"10.29306/jseg.2023.15.1.183","DOIUrl":null,"url":null,"abstract":"The introduction of the high school credit system has increased the number of subjects available to students, resulting in unique exam schedules for each student. Our goal is to minimize manual effort and create exam schedules that meet specific requirements. To achieve this, we utilize exhaustive search techniques to ensure that each student’s enrolled subjects are included in their exam schedule. We measure student fatigue using an objective function that takes into account their satisfaction with each subject and its placement. We continuously generate schedules with lower average and standard deviation of fatigue for each student. To further optimize the schedules, we consider additional constraints such as grouping subjects that cannot be scheduled on the same day and taking into account the number of exam rooms available. Given the large number of possibilities involved in the search, we sort subjects and exam times according to fatigue levels and prioritize the search for difficult-to-allocate subjects and exam times. This reduces search time and allows us to create schedules more efficiently.","PeriodicalId":436249,"journal":{"name":"Korean Science Education Society for the Gifted","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling Algorithm for Test Period to Increase Student Satisfaction\",\"authors\":\"Ye Rim Han, Min Joon Cho, Jae Sook Kim\",\"doi\":\"10.29306/jseg.2023.15.1.183\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The introduction of the high school credit system has increased the number of subjects available to students, resulting in unique exam schedules for each student. Our goal is to minimize manual effort and create exam schedules that meet specific requirements. To achieve this, we utilize exhaustive search techniques to ensure that each student’s enrolled subjects are included in their exam schedule. We measure student fatigue using an objective function that takes into account their satisfaction with each subject and its placement. We continuously generate schedules with lower average and standard deviation of fatigue for each student. To further optimize the schedules, we consider additional constraints such as grouping subjects that cannot be scheduled on the same day and taking into account the number of exam rooms available. Given the large number of possibilities involved in the search, we sort subjects and exam times according to fatigue levels and prioritize the search for difficult-to-allocate subjects and exam times. This reduces search time and allows us to create schedules more efficiently.\",\"PeriodicalId\":436249,\"journal\":{\"name\":\"Korean Science Education Society for the Gifted\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Korean Science Education Society for the Gifted\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29306/jseg.2023.15.1.183\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Korean Science Education Society for the Gifted","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29306/jseg.2023.15.1.183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

高中学分制的引入增加了学生可以选择的科目数量,导致每个学生都有不同的考试时间表。我们的目标是尽量减少手工工作,并创建满足特定要求的考试时间表。为了实现这一目标,我们使用穷举搜索技术来确保每个学生的注册科目都包含在他们的考试时间表中。我们使用一个目标函数来衡量学生的疲劳程度,该函数考虑了他们对每门学科及其安置的满意度。我们不断地为每个学生生成较低的疲劳平均和标准差的时间表。为了进一步优化日程安排,我们考虑了额外的约束条件,例如将不能安排在同一天的科目分组,并考虑到可用的考场数量。考虑到搜索中涉及的大量可能性,我们根据疲劳程度对科目和考试时间进行排序,并优先搜索难以分配的科目和考试时间。这减少了搜索时间,并允许我们更有效地创建时间表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scheduling Algorithm for Test Period to Increase Student Satisfaction
The introduction of the high school credit system has increased the number of subjects available to students, resulting in unique exam schedules for each student. Our goal is to minimize manual effort and create exam schedules that meet specific requirements. To achieve this, we utilize exhaustive search techniques to ensure that each student’s enrolled subjects are included in their exam schedule. We measure student fatigue using an objective function that takes into account their satisfaction with each subject and its placement. We continuously generate schedules with lower average and standard deviation of fatigue for each student. To further optimize the schedules, we consider additional constraints such as grouping subjects that cannot be scheduled on the same day and taking into account the number of exam rooms available. Given the large number of possibilities involved in the search, we sort subjects and exam times according to fatigue levels and prioritize the search for difficult-to-allocate subjects and exam times. This reduces search time and allows us to create schedules more efficiently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信