Batched cloud resource allocation
As a fundamental optimisation problem, the problem of packing a given set of objects into the fewest possible bins has both important theoretical significance in algorithms and operations research and great application values for resource allocation, particularly in cloud computing and data centre management.
The goal of this project was to develop an algorithm to efficiently pack batches of multidimensional items into corresponding bins. The problem tackled in this research is new. The primary aim was to understand the current literature in bin packing and we present a new algorithm that we apply to the batched bin packing problem which improves the worst case of existing multidimensional online algorithms where items are received one by one.