.png){kind=icon}
返回
Efficient solutions for a university timetabling problem through integer programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2003.06.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Integer programming has always been an alternative for formulating combinatorial problems such as the university timetabling problem. However, the effort required for modeling complicated operational rules, as well as the computational difficulties that result from the size of real problems have discouraged researchers and made them turn their interest to other approaches. In this paper, a two-stage relaxation procedure that solves efficiently the integer programming formulation of a university timetabling problem is presented. The relaxation is performed in the first stage and concerns the constraints that warrantee consecutiveness in multi-period sessions of certain courses. These constraints, which are computationally heavier than the others, are recovered during the second stage and a number of sub-problems, one for each day of the week, are solved for local optima. Comparing to a solution approach that solves the problem in a single stage, computation time is reduced significantly without any loss in quality for the resulting timetables. The new solution approach gives a chance for further improvements in the final timetables, as well as for certain degree of interaction with the users during the construction of the timetables. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
timetabling
University timetabling
integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Comparative analysis of fruit quality and nutritional components of four muscadine grape cultivars.png)
IF0
PREAI
分享收藏分享收藏An integer programming formulation for a case study in university timetabling用于大学时间表案例研究的整数规划公式
PREAI
分享收藏
查看更多内容