Drawer algorithms for 1-space bounded multidimensional hyperbox packing

Paulina Grzegorek () and Janusz Januszewski ()
Additional contact information
Paulina Grzegorek: UTP University of Science and Technology
Janusz Januszewski: UTP University of Science and Technology

Journal of Combinatorial Optimization, 2019, vol. 37, issue 3, No 14, 1044 pages

Abstract: Abstract We study a multidimensional hyperbox packing with one active bin. The items (d-dimensional 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^{\circ }$$ 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$$ 3 . 5 d -competitive as well as a $$\ 12\cdot 3^d$$ 12 · 3 d -competitive online d-dimensional hyperbox packing algorithm with one active bin.

Keywords: Online algorithms; Bin packing; Multidimensional; One-space bounded; 68W27 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0338-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0338-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0338-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().