On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson . This problem is a generalization of the bin packing problem in which items may arrive and depart from the packing dynamically. The main result in this paper is a lower bound of 2.5 on the achievable competitive ratio, improving the best known 2.428 lower bound , and revealing that packing items of restricted form like unit fractions (i.e., of size 1/k for some integer k), which can guarantee a competitive ratio 2.4985 , is indeed easier.
We also investigate the resource augmentation analysis on the problem where the on-line algorithm can use bins of size b (> 1) times that of the optimal off-line algorithm. An interesting result is that we prove b = 2 is both necessary and sufficient for the on-line algorithm to match the performance of the optimal off-line algorithm, i.e., achieve 1-competitiveness. Further analysis is made to give a trade-off between the bin size multiplier b and the achievable competitive ratio.
KeywordsCompetitive Ratio Item Size Resource Augmentation Harmonic Algorithm Average Case Behavior
Unable to display preview. Download preview PDF.
- 1.Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. In: Munro, J.I. (ed.) SODA, pp. 224–233. SIAM, Philadelphia (2004)Google Scholar
- 4.Coffman Jr., E.G., Courcoubetis, C., Garey, M.R., Johnson, D.S., Shor, P.W., Weber, R.R., Yannakakis, M.: Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM J. Discrete Math. 13, 38–402 (2000)CrossRefMathSciNetGoogle Scholar
- 5.Coffman Jr., E.G., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: Combinatorial analysis. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization. Kluwer Academic Publishers, Dordrecht (1998)Google Scholar
- 8.Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Bin packing approximation algorithms: A survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, PWS, pp. 46–93 (1996)Google Scholar
- 9.Coffman Jr., E.G., Johnson, D.S., McGeoch, L.A., Shor, P.W., Weber, R.R.: Bin packing with discrete item sizes, Part III: Average case behavior of FFD and BFD (in preparation)Google Scholar
- 15.Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. In: 36th Annual Symposium on Foundations of Computer Science, pp. 214–221 (1995)Google Scholar