Machine Reassignment is a challenging problem for constraint programming (CP) and mixed integer linear programming (MILP) approaches, especially given the size of data centres. Hybrid solutions mixing CP and heuristic algorithms, such as, large neighbourhood search (CBLNS), also struggle to address the problem given its size and number of constraints. The multi-objective version of the Machine Reassignment Problem is even more challenging and it seems unlikely for CP, MILP or hybrid solutions to obtain good results in this context. As a result, the first approaches to address this problem have been based on other optimisation methods, including metaheuristics. In this paper we study three things: (i) under which conditions a mixed integer o...
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
Optimising the data centres of large IT organisations is complex as (i) they are composed of various...
This paper proposes an efficient Multi-Start Iterated Local Search for Packing Problems (MS-ILS-PPs)...
Machine Reassignment is a challenging problem for constraint programming (CP) and mixed integer line...
27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Vietri Sul Mare, I...
At a high level, data centres are large IT facilities hosting physical machines (servers) that often...
Data centres are facilities with large amount of machines (i.e., servers) and hosted processes (e.g....
International audienceData centres are facilities with large amount of machines (i.e., servers) and ...
International audienceThis paper proposes a new method for solving the Machine Reassignment Problem ...
International audienceIn this paper, we introduce a generalization of the vector bin packing problem...
Details our solution (team J19, qualified) to the EURO/ROADEF Challenge 2012, proposed by Google.Int...
In this paper, we introduce a generalization of the vector bin packing problem, where the bins have ...
International audienceThis paper proposes an efficient Multi-Start Iterated Local Search for Packing...
Google Machine Reassignment Problem (GMRP) is a recent real world problem proposed at ROADEF/EURO ch...
One of the main challenges in data centre operations involves optimally reassigning running processe...
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
Optimising the data centres of large IT organisations is complex as (i) they are composed of various...
This paper proposes an efficient Multi-Start Iterated Local Search for Packing Problems (MS-ILS-PPs)...
Machine Reassignment is a challenging problem for constraint programming (CP) and mixed integer line...
27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Vietri Sul Mare, I...
At a high level, data centres are large IT facilities hosting physical machines (servers) that often...
Data centres are facilities with large amount of machines (i.e., servers) and hosted processes (e.g....
International audienceData centres are facilities with large amount of machines (i.e., servers) and ...
International audienceThis paper proposes a new method for solving the Machine Reassignment Problem ...
International audienceIn this paper, we introduce a generalization of the vector bin packing problem...
Details our solution (team J19, qualified) to the EURO/ROADEF Challenge 2012, proposed by Google.Int...
In this paper, we introduce a generalization of the vector bin packing problem, where the bins have ...
International audienceThis paper proposes an efficient Multi-Start Iterated Local Search for Packing...
Google Machine Reassignment Problem (GMRP) is a recent real world problem proposed at ROADEF/EURO ch...
One of the main challenges in data centre operations involves optimally reassigning running processe...
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
Optimising the data centres of large IT organisations is complex as (i) they are composed of various...
This paper proposes an efficient Multi-Start Iterated Local Search for Packing Problems (MS-ILS-PPs)...