본문 바로가기
  • Home

A Constraint Programming-based Automated Course Timetabling System

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2019, 24(4), pp.27-34
  • DOI : 10.9708/jksci.2019.24.04.027
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : March 20, 2019
  • Accepted : April 17, 2019
  • Published : April 30, 2019

Junha Hwang ORD ID 1

1금오공과대학교

Accredited

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.

Citation status

* References for papers published after 2023 are currently being built.