Online bin packing with arbitrary release times

Authors:
Yongqiang Shi;Deshi Ye
Affiliations:
College of Economics, Zhejiang University, Hangzhou 310027, China;College of Computer Science, Zhejiang University, Hangzhou 310027, China
Venue:
Theoretical Computer Science
Year:
2008

Citing 7
Cited 0

An improved lower bound for on-line bin packing algorithms

Information Processing Letters
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the online bin packing problem

Journal of the ACM (JACM)
On-line Packing and Covering Problems

Developments from a June 1996 seminar on Online algorithms: the state of the art
On-line Scheduling for Jobs with Arbitrary Release Times

Computing
Strip packing with precedence constraints and strip packing with release times

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study a new variant of the online bin-packing problem, in which each item a"i is associated with a size a"i and also a release time r"i so that it must be placed at least r"i above the bottom of a bin. Items arrive in turn and must be assigned without any knowledge of subsequent items. The goal is to pack all items into unit-size bins using the minimum number of bins. We study the problem with all items have equal size. First, we show that the ANY FIT algorithm cannot be approximated within any constant. Then we present a best possible online algorithm with asymptotic competitive ratio of two.