An integer programming formulation for a case study in university timetabling [An article from: European Journal of Operational Research] | ![An integer programming formulation for a case study in university timetabling [An article from: European Journal of Operational Research]](http://ecx.images-amazon.com/images/I/51G4P0G7AGL._SL160_.jpg)
 enlarge | Authors: S. Daskalaki, T. Birbas, E. Housos
Publisher: Elsevier
Category: Book
Buy New: $5.95
Sales Rank: 5291298
Format: Html
Media: Digital
Publication Date: February 16, 2004
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
A novel 0-1 integer programming formulation of the university timetabling problem is presented. The model provides constraints for a great number of operational rules and requirements found in most academic institutions. Treated as an optimization problem, the objective is to minimize a linear cost function. With this objective, it is possible to consider the satisfaction of expressed preferences regarding teaching periods or days of the week or even classrooms for specified courses. Moreover, with suitable definition of the cost coefficients in the objective function it is possible to reduce the solution space and make the problem tractable. The model is solvable by existing software tools with IP solvers, even for large departments. The case of a five-year Engineering Department with a large number of courses and teachers is presented along with its solution as resulted from the presented IP formulation.
|
|
|
