Abstract
We address the machine reassignment problem proposed in the context of the ROADEF/EURO challenge 2012 in partnership with Google. The problem consists in reassigning a set of processes to a set of multiple-resource machines so as to minimize a weighted function of the machines load, the resources balance, and the costs of moving processes while satisfying numerous constraints. We propose an optimization-based heuristic that requires decomposing the problem into a sequence of small-sized instances that are iteratively solved using a general MIP solver. To speed-up the solution process several algorithmic expedients are embedded. Extensive computational experiments provide evidence that the proposed approach exhibits a very good performance.