Article ID: | iaor201530439 |
Volume: | 249 |
Issue: | 2 |
Start Page Number: | 560 |
End Page Number: | 576 |
Publication Date: | Mar 2016 |
Journal: | European Journal of Operational Research |
Authors: | Akkan Can, Erdem Klnk M, Koas Cenk |
Keywords: | combinatorial optimization, education, programming: integer, heuristics, networks |
This article describes a methodology developed to find robust solutions to a novel timetabling problem encountered during a course. The problem requires grouping student teams according to diversity/homogeneity criteria and assigning the groups to time‐slots for presenting their project results. In this article, we develop a mixed integer programming (MIP) formulation of the problem and then solve it with CPLEX. Rather than simply using the optimal solution reported, we obtain a set of solutions provided by the