Discussion about Constraint Programming Bin Packing Models

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.