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.

Fully-Dynamic Bin Packing with Limited Repacking

Fully dynamic bin packing revisited

A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem

On solving multiobjective bin packing problems using evolutionary particle swarm optimization - ScienceDirect

Binpacking Example (Branch-and-price): Problem description

Learning Physically Realizable Skills for Online Packing of General 3D Shapes

PDF] Fully dynamic bin packing revisited

Bin Packing Approximation Algorithms: Survey and Classification

A variable neighborhood search algorithm for the bin packing problem with compatible categories - ScienceDirect

PDF] Fully dynamic bin packing revisited

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

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

Blocking analysis of persistent resource allocations for M2M applications in wireless systems - Brown - 2016 - Transactions on Emerging Telecommunications Technologies - Wiley Online Library

PDF] Fully-Dynamic Bin Packing with Limited Repacking