Bin packing with divisible item sizes
Journal of Complexity
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
Online computation and competitive analysis
Online computation and competitive analysis
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
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
Windows Scheduling Problems for Broadcast Systems
SIAM Journal on Computing
Windows scheduling as a restricted version of bin packing
ACM Transactions on Algorithms (TALG)
On dynamic bin packing: an improved lower bound and resource augmentation analysis
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On-line windows scheduling of temporary items
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Dynamic bin packing with unit fraction items revisited
Information Processing Letters
Dynamic multi-dimensional bin packing
Journal of Discrete Algorithms
Competitive multi-dimensional dynamic bin packing via l-shape bin packing
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
SIGACT news online algorithms column 20: the power of harmony
ACM SIGACT News
Online inventory replenishment scheduling of temporary orders
Information Processing Letters
On-line bin packing with restricted repacking
Journal of Combinatorial Optimization
Hi-index | 5.23 |
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary times. We want to pack a sequence of unit fractions items (i.e., items with sizes 1/w for some integer w=1) into unit-size bins, such that the maximum number of bins ever used over all time is minimized. Tight and almost-tight performance bounds are found for the family of any-fit algorithms, including first-fit, best-fit, and worst-fit. In particular, we show that the competitive ratio of best-fit and worst-fit is 3, which is tight, and the competitive ratio of first-fit lies between 2.45 and 2.4942. We also show that no on-line algorithm is better than 2.428-competitive.