| COURSE TIMETABLING AT A TUNISIAN UNIVERSITY： A CASE STUDY |
| |
| 作者姓名： | Abdelaziz DAMMAK Abdelkarim ELLOUMI Hichem KAMOUN Jacques A.FERLAND |
| |
| 作者单位： | [1]Department of Applied Quantitative Methods, GlAD Laboratory University of Sfax, FSEG Tunisia [2]Departement d＇Informatique et de Recherche Operationnelle Universite de Montreal, Quebec, Canada |
| |
| 摘 要： | This paper deals with the Course Timetabling Problem at an institution in a Tunisian University. We introduce a heuristic procedure to construct a feasible timetable for all lectures and tutorials taken by different groups of each sub-section of any section. We describe the timetabling problem using a list of all specific hard and soft constraints. We formulate the problem as a set of linear constraints using two sets of binary variables corresponding to lectures and tutorials, respectively. This heuristic is illustrated with real data for a sub-section of the Faculty of Economics and Management Sciences of Sfax in Tunisia, and the resulting timetables are compared with those generated manually. The results of another full section have confirmed the good quality of the proposed heuristic when compared with the hand made solution.
|
| 关 键 词： | 大学教育 课程表 整数规划 启发式搜索 突尼斯 |
Course timetabling at a Tunisian University: A case study |
| |
| Abdelaziz DAMMAK,Abdelkarim ELLOUMI,Hichem KAMOUN,Jacques A.FERLAND.Course timetabling at a Tunisian University: A case study[J].Journal of Systems Science and Systems Engineering,2008,17(3):334-352. |
| |
| Authors: | Abdelaziz Dammak Abdelkarim Elloumi Hichem Kamoun Jacques A Ferland |
| |
| Institution: | 1. Department of Applied Quantitative Methods, GIAD Laboratory University of Sfax, FSEG, Tunisia
2. Département d'lnformatique et de Recherche Opérationnelle Université de Montréal, Quebec, Canada |
| |
| Abstract: | This paper deals with the Course Timetabling Problem at an institution in a Tunisian University.We introduce a heuristic procedure to construct a feasible timetable for all lectures and tutorials taken by different groups of each sub-section of any section.We describe the timetabling problem using a list of all specific hard and soft constraints.We formulate the problem as a set of linear constraints using two sets of binary variables corresponding to lectures and tutorials,respectively.This heuristic is il... |
| |
| Keywords: | Educational timetabling integer programming implementations heuristic search |
| 本文献已被 维普 万方数据 SpringerLink 等数据库收录！ |
