본문 바로가기
  • Home

The University Examination And Course Timetabling Problem With Integer Programming

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2019, 24(9), pp.9-20
  • DOI : 10.9708/jksci.2019.24.09.009
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : August 29, 2019
  • Accepted : September 18, 2019
  • Published : September 30, 2019

Chung Yerim 1 Hak Jin Kim 1

1연세대학교

Accredited

ABSTRACT

In this paper, we study the university timetabling problem, which consists of two subproblems, the university course timetabling problem and the examination timetabling problem. Given a set of classrooms, students, teachers, and lectures, the problem is to assign a number of courses (and examinations) to suitable timeslots and classrooms while satisfying the given set of constraints. We discuss the modeling and solution approaches to construct course and examination timetables for one of the largest Korean university. By using binary integer programming formulations, we describe these two complex real-world problems. Then, we propose a solution method, called NOGOOD, to solve the examination timetabling model. The computation results show that NOGOOD finds the optimal examination schedule for the given instance. Although we consider a specific instance of the university timetabling problem, the methods we use can be applicable to modeling and solving other timetabling problems.

Citation status

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