Computational complexities of university interview timetabling

Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka

Research output: Contribution to journalArticle

Abstract

This paper introduces a new timetabling problem on universities, called interview timetabling. In this problem, some constant number, say three, of referees are assigned to each of 2n graduate students. Our task is to construct a presentation timetable of these 2n students using n timeslots and two rooms, so that two students evaluated by the same referee must be assigned to different timeslots. The optimization goal is to minimize the total number of movements of all referees between two rooms. This problem comes from the real world in the interview timetabling in Kyoto University. We propose two restricted models of this problem, and investigate their time complexities.

Original languageEnglish
Pages (from-to)130-140
Number of pages11
JournalIEICE Transactions on Information and Systems
VolumeE92-D
Issue number2
DOIs
Publication statusPublished - Jan 1 2009

Fingerprint

Computational complexity
Students

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Cite this

Computational complexities of university interview timetabling. / Kamiyama, Naoyuki; Kiyonari, Yuuki; Miyano, Eiji; Miyazaki, Shuichi; Yamanaka, Katsuhisa.

In: IEICE Transactions on Information and Systems, Vol. E92-D, No. 2, 01.01.2009, p. 130-140.

Research output: Contribution to journalArticle

Kamiyama, Naoyuki ; Kiyonari, Yuuki ; Miyano, Eiji ; Miyazaki, Shuichi ; Yamanaka, Katsuhisa. / Computational complexities of university interview timetabling. In: IEICE Transactions on Information and Systems. 2009 ; Vol. E92-D, No. 2. pp. 130-140.
@article{e8b5653e51c24cf3a0c6b0ff4a1eb46d,
title = "Computational complexities of university interview timetabling",
abstract = "This paper introduces a new timetabling problem on universities, called interview timetabling. In this problem, some constant number, say three, of referees are assigned to each of 2n graduate students. Our task is to construct a presentation timetable of these 2n students using n timeslots and two rooms, so that two students evaluated by the same referee must be assigned to different timeslots. The optimization goal is to minimize the total number of movements of all referees between two rooms. This problem comes from the real world in the interview timetabling in Kyoto University. We propose two restricted models of this problem, and investigate their time complexities.",
author = "Naoyuki Kamiyama and Yuuki Kiyonari and Eiji Miyano and Shuichi Miyazaki and Katsuhisa Yamanaka",
year = "2009",
month = "1",
day = "1",
doi = "10.1587/transinf.E92.D.130",
language = "English",
volume = "E92-D",
pages = "130--140",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "2",

}

TY - JOUR

T1 - Computational complexities of university interview timetabling

AU - Kamiyama, Naoyuki

AU - Kiyonari, Yuuki

AU - Miyano, Eiji

AU - Miyazaki, Shuichi

AU - Yamanaka, Katsuhisa

PY - 2009/1/1

Y1 - 2009/1/1

N2 - This paper introduces a new timetabling problem on universities, called interview timetabling. In this problem, some constant number, say three, of referees are assigned to each of 2n graduate students. Our task is to construct a presentation timetable of these 2n students using n timeslots and two rooms, so that two students evaluated by the same referee must be assigned to different timeslots. The optimization goal is to minimize the total number of movements of all referees between two rooms. This problem comes from the real world in the interview timetabling in Kyoto University. We propose two restricted models of this problem, and investigate their time complexities.

AB - This paper introduces a new timetabling problem on universities, called interview timetabling. In this problem, some constant number, say three, of referees are assigned to each of 2n graduate students. Our task is to construct a presentation timetable of these 2n students using n timeslots and two rooms, so that two students evaluated by the same referee must be assigned to different timeslots. The optimization goal is to minimize the total number of movements of all referees between two rooms. This problem comes from the real world in the interview timetabling in Kyoto University. We propose two restricted models of this problem, and investigate their time complexities.

UR - http://www.scopus.com/inward/record.url?scp=77950347126&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77950347126&partnerID=8YFLogxK

U2 - 10.1587/transinf.E92.D.130

DO - 10.1587/transinf.E92.D.130

M3 - Article

AN - SCOPUS:77950347126

VL - E92-D

SP - 130

EP - 140

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 2

ER -