Abstract
This paper treats an allocation of a fixed amount of discrete resources to a set of activities so that the performances of activities resulted from the allocation are balanced as much as possible. However, the perfect balanced allocation is not possible, in general, due to the discreteness of resources. So, our aim is to minimize imbalance among the performances. We consider the variance of the performances among activities as a measure of the imbalance. Thus, our problem is formulated as a minimum-variance resource allocation problem. We propose a branch-and-bound algorithm whose experimental computer program was run on 12, 000 examples.
