.png){kind=icon}
返回
The classroom assignment problem: Complexity, size reduction and heuristics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2013.09.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we investigate a compound of the exam timetabling problems which consists of assigning a set of independent exams to a certain number of classrooms. We can define the exam timetabling problem as the scheduling of exams to time slots in first stage and at a second stage, the assignment of a set of exams extracted from one time slot to some available classrooms. Even though the formulation of this problem looks simple as it contains only two sets of constraints including only binary variables, we show that it belongs to the class of NP hard problems by reduction from the Numerical Matching with Target Sum problems (NMTS). In order to reduce the size of this problem and make it efficiently solvable either by exact method or heuristic approaches, a theorem is rigorously demonstrated and a reduction procedure inspired from the dominance criterion is developed. The two methods contribute in the search for a feasible solution by reducing the size of the original problem without affecting the feasibility. Since the reduction procedures do not usually assign all exams to classrooms, we propose a Variable Neighbourhood Search (VNS) algorithm in order to obtain a good quality complete solution. The objective of VNS algorithm is to reduce the total classroom capacity assigned to exams. A numerical result concerning the exam of the main session of the first semester of the academic year 2009-2010 of the Faculty of Economics and Management Sciences of Sfax shows the good performance of our approach compared with lower bound defined as the sum of the total capacity of all assigned classrooms and the total size of the remaining exams after reduction. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Exam timetabling
Classroom assignment
Complexity Size reduction
Variable neighbourhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution马来西亚彭亨大学的考试时间表问题: 建设性启发式与现有软件解决方案的比较
PREAI
分享收藏
查看更多内容