Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892926 | Computers & Operations Research | 2014 | 9 Pages |
Abstract
This paper presents and analyzes a model for the problem of placing applications on computer clusters (APP). In this problem, organizations requesting a set of software applications have to be assigned to computer clusters such that the costs of opening clusters and installing the necessary applications are minimized. This problem is related to known OR problems such as the multiproduct facility location problem and the generalized bin packing problem. We show that APP is NP-hard, and then propose a simple Tabu Search heuristic to solve it. The performance of the Tabu Search heuristic is assessed via extensive computational experiments, which indicate the promise of the proposed Tabu Search.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jelmer P. van der Gaast, Cornelius A. Rietveld, Adriana F. Gabor, Yingqian Zhang,