Dynamic multi-dimensional bin packing

13Citations
Citations of this article
31Readers
Mendeley users who have this article in their library.

Abstract

A natural generalization of the classical online bin packing problem is the dynamic bin packing problem introduced by Coffman et al. (1983) [7]. In this formulation, items arrive and depart and the objective is to minimize the maximal number of bins ever used over all times. We study the oriented multi-dimensional dynamic bin packing problem for two dimensions, three dimensions and multiple dimensions. Specifically, we consider dynamic packing of squares and rectangles into unit squares and dynamic packing of three-dimensional cubes and boxes into unit cubes. We also study dynamic d-dimensional hypercube and hyperbox packing. For dynamic d-dimensional box packing we define and analyze the algorithm NFDH for the offline problem and present a dynamic version. This algorithm was studied before for rectangle packing and for square packing and was generalized only for multi-dimensional cubes. We present upper and lower bounds for each of these cases. © 2010 Elsevier B.V.

Cite

CITATION STYLE

APA

Epstein, L., & Levy, M. (2010). Dynamic multi-dimensional bin packing. Journal of Discrete Algorithms, 8(4), 356–372. https://doi.org/10.1016/j.jda.2010.07.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free