OPTIMIZING EXAM SCHEDULES: A LITERATURE SURVEY

dc.contributor.authorMamay K.
dc.date.accessioned2024-01-04T04:00:37Z
dc.date.available2024-01-04T04:00:37Z
dc.date.issued2023
dc.description.abstractAbstract. Exam scheduling is a challenging problem that involves finding an optimal schedule for a set of exams subject to various constraints, such as room capacities, time windows, and conflicting exams. This problem has been extensively studied in operations research and computer science and various methods have been proposed over the years. In this paper, we present a comprehensive literature review of the existing methods for exam scheduling optimization. We summarize the key contributions, strengths, and weaknesses of each approach and compare and contrast the various methods based on various performance measures such as solution quality, computational time, and scalability. Additionally, we discuss the real-world applications of the exam scheduling problem and the impact of different methods on practical solutions. Finally, we provide insights into the current state of the art in exam scheduling and suggest future directions for research. Our survey provides a useful resource for researchers, practitioners, and decision-makers who are interested in exam scheduling optimization.
dc.identifier.citationKuanyshbek Mamay / OPTIMIZING EXAM SCHEDULES: A LITERATURE SURVEY / СДУ хабаршысы - 2023
dc.identifier.issn2709-2631
dc.identifier.urihttps://repository.sdu.edu.kz/handle/123456789/1092
dc.language.isoen
dc.publisherСДУ хабаршысы - 2023
dc.subjecttimetabling
dc.subjectscheduling
dc.subjectexamination timetabling
dc.subjectСДУ хабаршысы - 2023
dc.subject№1
dc.titleOPTIMIZING EXAM SCHEDULES: A LITERATURE SURVEY
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2023.1 жаратылыстану-62-71.pdf
Size:
4.84 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
13.85 KB
Format:
Item-specific license agreed to upon submission
Description: