Constrained Group Balancing: Why Does it Work

Abstract

We consider a set of objects possessing multiple attributes that must be partitioned into a certain number of groups so that the groups are as balanced as possible with respect to the number of objects possessing each attribute. This problem arises in a variety of applications, ranging from assigning students to study groups to designing level schedules for JIT assembly lines. A direct approach, enforcing balance through hard constraints, may lead to infeasibility, but works well in practice. We analyze this phenomenon from the worst-case and empirical perspectives, as well as through an in-depth analysis of one representative practical application - the design of student groups at the Rotman School of Management, University of Toronto. The goals of the analysis are to understand what classes of balancing problems may contain infeasible instances and how prevalent such instances are within these classes, as well as to synthesize practical managerial insights that a decision-maker could follow in order to increase the chances that balanced groups can be found.

Keywords: group, balancing, integer, programming, constraint, constrained, application, OR, MS, education