A Constraint Programming-based Automated Course Timetabling SystemA Constraint Programming-based Automated Course Timetabling System
- Other Titles
- A Constraint Programming-based Automated Course Timetabling System
- Authors
- 황준하
- Issue Date
- 2019
- Publisher
- 한국컴퓨터정보학회
- Keywords
- Timetabling; Course Timetabling Problem; Constraint Programming
- Citation
- 한국컴퓨터정보학회논문지, v.24, no.4, pp 27 - 34
- Pages
- 8
- Journal Title
- 한국컴퓨터정보학회논문지
- Volume
- 24
- Number
- 4
- Start Page
- 27
- End Page
- 34
- URI
- https://scholarworks.bwise.kr/kumoh/handle/2020.sw.kumoh/25481
- DOI
- 10.9708/jksci.2019.24.04.027
- ISSN
- 1598-849X
2383-9945
- Abstract
- The course timetabling problem is a kind of very complex combinatorial optimization problems, which is known as an NP-complete problem. Sometimes a given course timetabling problem can be accompanied by many constraints. At this time, even if only one constraint is violated, it can be an infeasible timetable. Therefore, it is very difficult to make an automated course timetabling system for a complex real-world course timetabling problem. This paper introduces an automated course timetabling system using constraint programming. The target problem has 26 constraints in total, and they are expressed as 24 constraints and an objective function in constraint programming. Currently, we are making a timetable through this system and applying the result to the actual class. Members’ satisfaction is also much higher than manual results. We expect this paper can be a guide for making an automated course timetabling system.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Department of Computer Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.