Optimal On-Line Bin Packing with Two Item Sizes
نویسندگان
چکیده
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We present an algorithm which shows that this lower bound is also an upper bound. Hence the asymptotic competitive ratio for this on-line problem is equal to 4/3. Our result extends the corresponding result of Faigle, Kern and Turan (1989) for item sizes restricted to 12 − 2 and 12 + 2 for any fixed nonnegative 2 < 1 6 .
منابع مشابه
Approaches to Bin Packing with Clique-Graph Conflicts
The problem of bin packing with arbitrary conflicts was introduced in [3]. In this paper, we consider a restricted problem, bin packing with clique-graph conflicts. We prove bounds for several approximation algorithms, and show that certain onand off-line algorithms are equivalent. Finally, we present an optimal polynomial-time algorithm for the case of constant item sizes, and analyze its perf...
متن کاملBin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
We consider the one-dimensional bin packing problem with unit-capacity bins and item sizes chosen according to the discrete uniform distribution Ufj; kg, 1 < j k; where each item size in f1=k; 2=k; : : : ; j=kg has probability 1=j of being chosen. Note that for xed j; k as m ! 1 the discrete distributions Ufmj; mkg approach the continuous distribution U(0; j=k], where the item sizes are chosen ...
متن کاملBin packing with divisible item sizes
We study a variety of NP-hard bin packing problems under a divisibility constraint that generalizes the often encountered situation in which all item sizes are powers of 2. For ordinary one-dimensional bin packing, we show that First Fit Decreasing produces optimal packings under this restriction, and that if in addition the largest item size divides the bin capacity, then even the less powerfu...
متن کاملMore on online bin packing with two item sizes
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, where both item sizes are bounded from above by 1 k for some natural number k ≥ 1. We show that for every possible pair of item sizes, there is an algorithm with competitive ratio of at most (k+1) 2 k2+k+1 . We prove that...
متن کاملAlgorithms for on-line bin-packing problems with cardinality constraints
The bin-packing problem asks for a packing of a list of items of sizes from (0; 1] into the smallest possible number of bins having unit capacity. The k-item bin-packing problem additionally imposes the constraint that at most k items are allowed in one bin. We present two e6cient on-line algorithms for this problem. We show that, for increasing values of k, the bound on the asymptotic worst-ca...
متن کامل