.png){kind=icon}
.png){kind=icon}
Return
An optimization-based heuristic for the machine reassignment problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-015-2002-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Machine reassignment
Optimization-based heuristic
Mixed integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W