Discussion about Constraint Programming Bin Packing Models

Abstract : The bin packing problem is one of the core problems of cloud computing management. It corresponds to the problem of assigning virtual machines to servers. However, cloud computing also imposes a huge variety of constraints on this problem and most of them can not be expressed a priori. Constraint Programming (CP) has been proved efficient for solving bin packing instances and for its capability to deal with unexpected constraints. Nevertheless, CP approaches have never been tested on large scale instances coming from cloud computing. In this paper, we describe some CP models for solving bin packing instances and we expect that some experiments could identify precisely the advantages and the drawbacks of these models for solving real life instances.
Type de document :
Communication dans un congrès
AI for Data Center Management and Cloud Computing Workshop during the 25th AAAI Conference on Artificial Intelligence (AAAI-11) , Aug 2011, San Francisco, CA, United States
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01344044
Contributeur : Jean-Charles Regin <>
Soumis le : samedi 16 juillet 2016 - 12:08:10
Dernière modification le : jeudi 21 juillet 2016 - 01:11:53

Identifiants

  • HAL Id : hal-01344044, version 1

Collections

Citation

Jean-Charles Régin, Mohamed Rezgui. Discussion about Constraint Programming Bin Packing Models. AI for Data Center Management and Cloud Computing Workshop during the 25th AAAI Conference on Artificial Intelligence (AAAI-11) , Aug 2011, San Francisco, CA, United States. <hal-01344044>

Partager

Métriques

Consultations de la notice

60