Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.ejor.2003.06.023 | European Journal of Operational Research |
Keywords | Field | DocType |
Timetabling,University timetabling,Integer programming | Mathematical optimization,Local optimum,Integer programming,Timetabling problem,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
160 | 1 | 0377-2217 |
Citations | PageRank | References |
38 | 1.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sophia Daskalaki | 1 | 295 | 18.52 |
| Theodore Birbas | 2 | 114 | 4.37 |