IEICE TRANSACTIONS on Information
Computational Complexities of University Interview Timetabling
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.2 pp.130-140
- Publication Date
- 2009/02/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E92.D.130
- Type of Manuscript
- Special Section PAPER (Special Section on Foundations of Computer Science)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Naoyuki KAMIYAMA, Yuuki KIYONARI, Eiji MIYANO, Shuichi MIYAZAKI, Katsuhisa YAMANAKA, "Computational Complexities of University Interview Timetabling" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 2, pp. 130-140, February 2009, doi: 10.1587/transinf.E92.D.130.
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.130/_p
Copy
@ARTICLE{e92-d_2_130,
author={Naoyuki KAMIYAMA, Yuuki KIYONARI, Eiji MIYANO, Shuichi MIYAZAKI, Katsuhisa YAMANAKA, },
journal={IEICE TRANSACTIONS on Information},
title={Computational Complexities of University Interview Timetabling},
year={2009},
volume={E92-D},
number={2},
pages={130-140},
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.},
keywords={},
doi={10.1587/transinf.E92.D.130},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Computational Complexities of University Interview Timetabling
T2 - IEICE TRANSACTIONS on Information
SP - 130
EP - 140
AU - Naoyuki KAMIYAMA
AU - Yuuki KIYONARI
AU - Eiji MIYANO
AU - Shuichi MIYAZAKI
AU - Katsuhisa YAMANAKA
PY - 2009
DO - 10.1587/transinf.E92.D.130
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2009
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.
ER -
English
