We study a multidimensional hyperbox packing with one active bin. The items (ddimensional hyperboxes of edge length not greater than 1) arrive one by one. Each item must be packed online into a hypercube bin of edge 1 and 90 • -rotations are allowed. If it is impossible to pack an item into an active bin, we close the bin and open a new active bin to pack that item. In this paper, we present a 3.5 d -competitive as well as a 12 · 3 d -competitive online d-dimensional hyperbox packing algorithm with one active bin.
Grzegorek and Januszewski REF presented a 3.5 d -competitive as well as a 12·3 d -competitive online d-dimensional hyperbox packing algorithm with one active bin.
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
Journal of Combinatorial Optimization
Mathematics Computer Science