In some schools and universities, students must sometimes be divided into several teams in such a way that each team provides a good representation of the classroom population. In this paper two different ways of measuring the balance among teams are proposed: min-sum and min-max objective functions. For the first function and the L1-norm used in the space of attributes, an exact solution method based on a set partitioning formulation and on the enumeration of all possible team patterns is presented. For the second objective function, a set partitioning formulation is also considered, but as an approximation. In order to solve large problem instances, we have also developed metaheuristics based on variable neighborhood search. Models and methods are tested on data from a MBA program.
Paru en septembre 2002 , 14 pages
Ce cahier a été révisé en mars 2004