点击次数：

论文类型：会议论文

发表时间：2011-05-28

收录刊物：EI、CPCI-S、Scopus

卷号：6681

页面范围：308-318

摘要：In this paper, we study 1-space bounded multi-dimensional bin packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional space, any two dimensions i and j define a space P-ij. When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items, and 90 degrees-rotation on any plane P-ij is allowed.
   The objective is to minimize the total number of bins used for packing all these items in the sequence. In the 1-space bounded variant, there is only one active bin for packing the current item. If the active bin does not have enough space to pack the item, it must be closed and a new active bin is opened. For this problem, we give an online algorithm with competitive ratio 4(d), which is the first study on 1-space bounded d-dimensional bin packing.