haku: @indexterm Integer programming / yhteensä: 355
viite: 9 / 355
| Tekijä: | Daskalaki, S. Birbas, T. Housos, E. |
| Otsikko: | An integer programming formulation for a case study in university timetabling |
| Lehti: | European Journal of Operational Research
2004 : FEB, VOL. 153:1, p. 117-135 |
| Asiasana: | Timetabling Integer programming Universities Case studies |
| Kieli: | eng |
| Tiivistelmä: | 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 azademic institutions. Treated as an optimization problem, the objective is to minimize a linear cost function. With this objective, it is possible to consider the astisfaction of expressed preferences regarding teaching periods or days of the week or even classrooms for specific courses. 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. |
SCIMA