A New Bin Packing Algorithm with Buffer

Minghui Zhang,Yan Lan, Hanxi Li

international conference on intelligent transportation big data and smart city（2018）

引用 3|浏览0

暂无评分

摘要

In this paper we study the classical bin packing problem with a buffer of constant size. There are n items with size within (0,1] and when a new item is given, it can be stored in the buffer temporarily or packed into some bin.Once it is packed in the bin, we cannot repack it. It has been proved as a NP-hard problem by some researchers when P ≠ NP. We proposed an online algorithm with asymptotic competitive ratio 1.71 in this paper.

查看译文

关键词

Siphonic Bin packing,Buffer,Online algorithm,Asymptotic competitive ratio

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要