An integer programming formulation for a case study in university timetabling

被引:143
作者
Daskalaki, S [1 ]
Birbas, T
Housos, E
机构
[1] Univ Patras, Dept Engn Sci, GR-26500 Patras, Greece
[2] Univ Patras, Dept Elect & Comp Engn, GR-26500 Patras, Greece
关键词
timetabling; integer programming; university timetabling;
D O I
10.1016/S0377-2217(03)00103-6
中图分类号
C93 [管理学];
学科分类号
12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];
摘要
A novel 0-1 integer programming formulation of the university timetabling problem is presented. The model provides constraints for a great number of operational rules and requirements found in most academic institutions. Treated as an optimization problem, the objective is to minimize a linear cost function. With this objective, it is possible to consider the satisfaction of expressed preferences regarding teaching periods or days of the week or even classrooms for specified courses. Moreover, with suitable definition of the cost coefficients in the objective function it is possible to reduce the solution space and make the problem tractable. The model is solvable by existing software tools with IP solvers, even for large departments. The case of a five-year Engineering Department with a large number of courses and teachers is presented along with its solution as resulted from the presented IP formulation. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:117 / 135
页数:19
相关论文
共 35 条
[1]
AKKOYUNLU EA, 1973, COMPUT J, V16, P347, DOI 10.1093/comjnl/16.4.347
[2]
[Anonymous], INFORMS J COMPUTING
[3]
AUBIN J, 1989, COMPUTERS OPERATIONA, V18, P67
[4]
A multi-objective course scheduling model: Combining faculty preferences for courses and times [J].
Badri, MA ;
Davis, DL ;
Davis, DF ;
Hollingsworth, J .
COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (04) :303-316
[5]
BARDADYM AV, 1995, LECT NOTES COMPUTER, V1153, P22
[6]
Birbas T, 1997, J OPER RES SOC, V48, P1191
[7]
Birbas T., 1997, 4 BALK C OP RES THES
[9]
Burke E K, 1994, AISB WORKSH EV COMP
[10]
BURKE EK, 1994, 22 E W INT C COMP TE, V1, P35