정수계획법을 이용한 대학강의 시험시간 및 강의실 배정 문제의 풀이

• Published in: 한국컴퓨터정보학회논문지 Vol. 24; no. 9; pp. 9 - 20
• Main Authors: 정예림(Yerim Chung), 김학진(Hak-Jin Kim)
• Format: Journal Article
• Language: Korean
• Published: 한국컴퓨터정보학회 01.09.2019
• Subjects: 컴퓨터학; Examination Timetabling Problem; University Course Timetabling Problem; Constraint Programming; Integer Programming; NOGOOD Method
• ISSN: 1598-849X; 2383-9945
• DOI: 10.9708/jksci.2019.24.09.009

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. KCI Citation Count: 0