PDF] Fully-Dynamic Bin Packing with Limited Repacking

This work presents optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure, motivated by cloud storage applications. We study the classic Bin Packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio \emph{while repacking items sparingly} between updates. Formally, each item $i$ has a \emph{movement cost} $c_i\geq 0$, and we want to use $\alpha \cdot OPT$ bins and incur a movement cost $\gamma\cdot c_i$, either in the worst case, or in an amortized sense, for $\alpha, \gamma$ as small as possible. We call $\gamma$ the \emph{recourse} of the algorithm. This is motivated by cloud storage applications, where fully-dynamic Bin Packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure.

Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system

PDF] Fully-Dynamic Bin Packing with Limited Repacking

The rectangular two-dimensional strip packing problem real-life practical constraints: A bibliometric overview - ScienceDirect

Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm - IOS Press

Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications

Enhanced Virtualization-Based Dynamic Bin-Packing Optimized Energy Management Solution for Heterogeneous Clouds

PDF] The load-balanced multi-dimensional bin-packing problem

Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm - IOS Press

On-line three-dimensional packing problems: A review of off-line and on-line solution approaches - ScienceDirect

PDF] Fully dynamic bin packing revisited