A two stage heuristic algorithm for solving the server consolidation problem with item-item and bin-item incompatibility constraints

Proceedings - 2008 IEEE International Conference on Services Computing, SCC 2008

Volumn 2, Issue , 2008, Pages 39-46

  Gupta, Rohit ^a   Bose, Sumit Kumar ^a   Sundarrajan, Srikanth ^a   Chebiyam, Manogna ^a   Chakrabarti, Anirban ^a  

^a SETLabs

Author keywords

[No Author keywords available]

Indexed keywords

DEDICATED SERVERS; INTERNATIONAL CONFERENCES; SERVER CONSOLIDATION; TWO STAGES;

BINS; BOOLEAN FUNCTIONS; CONSOLIDATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; PORTALS; SERVERS;

PROBLEM SOLVING;

EID: 51749108415     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCC.2008.39     Document Type: Conference Paper

References (16)

1. UNIX Server Consolidation Survey, Press Release: http://63.247.141.49/ ∼gcg/index.php?option=com_content &task=view&id=24&Itemid=50
2. Phelps, J. (2004), "CIO Update: Server consolidation can offer a range of benefits", White Paper, Gartner Inc.
3. Gartner Research, (2002), "Server Consolidation: Benefits & Challenges".
4. st Annual Conference of the Japanese Society for Artificial Intelligence.
5. Zhang, A., Safai, F., and Beyer, D., (2005) "Applying Bin-Packing Algorithms to Server Consolidation", Informs annual meeting in San Francisco.
6. Zhang, A., "A High-Dimensional Bin-Packing Algorithm for Server Consolidation", http://www2.twgrid.org/event/isgc2006/Presentation%20 Material/0504-Industry%20Track/Industry-Meichun-05042006.pdf
7. Chu, C., and La, R., (2001), "Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms", SIAM Journal of Computing, 30, 2069-2083.
8. Kang, J., and Park, S., (2003) "Algorithms for the variable sized bin packing problem", European Journal Operational Research, 147, 365-372.
9. Gendreau, M. Laporte, G. and Semet, F., (2004), "Heuristics and lower bounds for the bin packing problem with conflicts", Computers and Operations Research , 31, 347-358.
10. Epstein, L. and Levin, A., "On bin packing with conflicts", math.haifa.ac.il/lea/bpc.pdf
11. Jansen, K. (1999), "An approximation Scheme for bin packing with conflicts", Journal of Combinatorial Optimization, 3, 363-377.
12. th 16 Workshop on Information Technologies and Systems, Milwaukee, USA.
13. Garey, M. R., and Johnson, D. S., (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness", W.H. Freeman, ISBN 0-7167-1045-5.
14. Welsh, D.J.A., and Powell, M.B., (1967), "The upper bound for the chromatic number of a graph and its application to timetabling problems", The Computer Journal, 11, 41-47.
15. Jansen., K, and Oehring, S., (1997), "Approximation algorithms for time constrained scheduling", Information and Computation, 132, 85-108.
16. Falkenauer E., (2004), "A Hybrid Grouping Genetic Algorithm for Bin Packing", Journal of Heuristics, 2, 5-30