We consider an NP-hard temporal bin packing problem with a number of items, or so-called virtual machines. For each machine, we have information about the creation time, the deletion time, the number of cores, and the amount of RAM. All items are divided into two types: large and small. Each container (server) consists of several different parts called NUMA nodes. Small items can be completely placed on one of the nodes, whereas large items are divided into two identical halves, which are placed on different nodes. Servers are located in racks, and some virtual machines are grouped together. Each group is divided into partitions. Virtual machines from different partitions of the same group conflict with each other, which means that they cannot be placed on the same rack. This approach is necessary for the fault tolerance of the system. We want to efficiently pack all virtual machines into the minimum number of racks