STUDY ON SCHEDULING PROBLEM TOWARDS TARGETED OUTREACH, APPLIED TO UNIVERSITY SCHEDULING

TRAN Hai Thanh, NGUYEN Lan Oanh, NGUYEN Thu Phuong, NGUYEN Thi Duyen
{"title":"STUDY ON SCHEDULING PROBLEM TOWARDS TARGETED OUTREACH, APPLIED TO UNIVERSITY SCHEDULING","authors":"TRAN Hai Thanh, NGUYEN Lan Oanh, NGUYEN Thu Phuong, NGUYEN Thi Duyen","doi":"10.56824/vujs.2023a063","DOIUrl":null,"url":null,"abstract":"This paper focuses on researching, analyzing, and evaluating universities scheduling problem which requires scheduling multiple classes, different teachers and classrooms, along with various constraints such as teacher's teaching hours, classroom capacity, and other resources. In order to solve this problem, Tabu search algorithm has been proposed, which based on searching for the best solutions for adaptive memory and reactive exploration. The constraints and limitations of the problem will be used to create a list of Tabu conditions to ensure that non-optimal solutions will not be repeated. After initializing and updating the adaptive memory, the Tabu search algorithm will search for the next solutions based on the Tabu conditions and adaptive memory. In this way, the Tabu search algorithm can find optimal solutions for this scheduling problem for universities. However, there are many challenges and limitations in the application of this algorithm, such as the large number of constraints to be follow, the determination of suitable parameters, and the dependence on the programmer's experience","PeriodicalId":447825,"journal":{"name":"Vinh University Journal of Science","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vinh University Journal of Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.56824/vujs.2023a063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper focuses on researching, analyzing, and evaluating universities scheduling problem which requires scheduling multiple classes, different teachers and classrooms, along with various constraints such as teacher's teaching hours, classroom capacity, and other resources. In order to solve this problem, Tabu search algorithm has been proposed, which based on searching for the best solutions for adaptive memory and reactive exploration. The constraints and limitations of the problem will be used to create a list of Tabu conditions to ensure that non-optimal solutions will not be repeated. After initializing and updating the adaptive memory, the Tabu search algorithm will search for the next solutions based on the Tabu conditions and adaptive memory. In this way, the Tabu search algorithm can find optimal solutions for this scheduling problem for universities. However, there are many challenges and limitations in the application of this algorithm, such as the large number of constraints to be follow, the determination of suitable parameters, and the dependence on the programmer's experience
定向外展调度问题研究,在高校调度中的应用
本文主要研究、分析和评价大学排课问题,该问题需要安排多个班级、不同的教师和教室,以及教师的教学时数、教室容量和其他资源等各种约束条件。为了解决这一问题,提出了禁忌搜索算法,该算法基于搜索自适应记忆和响应式探索的最佳解。问题的约束和限制将用于创建禁忌条件列表,以确保非最优解不会重复出现。在初始化和更新自适应内存后,禁忌搜索算法根据禁忌条件和自适应内存搜索下一个解。这样,禁忌搜索算法就可以找到高校调度问题的最优解。然而,该算法在应用中存在许多挑战和局限性,如需要遵循的约束条件较多,需要确定合适的参数,依赖于程序员的经验等
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信