.png){kind=icon}
.png){kind=icon}
Return
Timetabling problems at the TU Eindhoven
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2008.04.038.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The students of the Department of Industrial Design at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by handing in ordered preference lists with their favorite courses for the forthcoming time period. Based on this information (and on many other constraints), the department then assigns courses to students. Until recently, the assignment was computed by human schedulers who used a quite straightforward greedy approach. In 2005, however, the number of students increased substantially, and as a consequence the greedy approach did not yield acceptable results anymore. This paper discusses the solution of this real-world timetabling problem. We present a complete mathematical formulation and explain all the constraints resulting from the situation in Eindhoven. We solve the problem using lexicographical optimization with four subproblems. For all four subproblems, an elegant integer linear programming model is given which easily can be put into CPLEX. Finally, we report on our computational experiments and results around the Eindhoven real-world data. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Integer programming
University timetabling
Network flow formulation
NP-completeness
Lexicographical optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W