Abstract
An online algorithm for variable-sized bin packing, based on the Harmonic algorithm of Lee and Lee [11], is investigated. This algorithm is based on one proposed by Csirik [4]. It is shown that the algorithm is optimal among those which use bounded space. An interesting feature of the analysis is that, although it is shown that our algorithm achieves a performance ratio arbitrarily close to the optimum value, it is not known precisely what that value is. The case where bins of capacity 1 and α ∈ (0,1) are used is studied in greater detail. It is shown that among algorithms which are allowed to chose α, the optimal performance ratio lies in [1.37530,1.37532].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brown, D.J. A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana-Champaign, 1979.
Burkard, R., AND Zhang, G. Bounded space on-line variable-sized bin packing. Acta Cybernetica 13,1 (1997), 63–76.
Coffman, E. G., Garey, M. R., AND Johnson, D.S. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, D. Hochbuam, Ed. PWS Publishing Company, 1997, ch. 2.
Csirik, J. An on-line algorithm for variable-sized bin packing. Acta Informatica 26,8 (1989), 697–709.
Csirik, J., AND Woeginger, G. On-line packing and covering problems. In On-Line Algorithms—The State of the Art, A. Fiat and G. Woeginger, Eds., Lecture Notes in Computer Science. Springer-Verlag, 1998, ch. 7.
Friesen, D. K., AND Langston, M. A. Variable sized bin packing. SIAM Journal on Computing 15 (1986), 222–230.
Johnson, D.S.Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1973.
Johnson, D.S. Fast algorithms for bin packing. Journal Computer Systems Science 8 (1974), 272–314.
Johnson, D.S., Demers, A., Ullman, J. D., Garey, M. R., andGraham, R. L.. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3 (1974), 256–278.
Kinnersley, N., AND Langston, M. Online variable-sized bin packing. Discrete Applied Mathematics 22,2 (Feb1989), 143–148.
Lee, C., AND Lee, D. A simple on-line bin-packing algorithm. Journal of the ACM 32,3 (Jul1985), 562–572.
Liang, F.M. A lower bound for online bin packing. Information Processing Letters 10 (1980), 76–79.
Ramanan, P., Brown, D., Lee, C., AND Lee, D. On-line bin packing in linear time. Journal of Algorithms 10,3 (Sep 1989), 305–326.
Richey, M. B. Improved bounds for harmonic-based bin packing algorithms. Discrete Applied Mathematics 34 (1991), 203–227.
Van Vliet, A. An improved lower bound for online bin packing algorithms. Information Processing Letters 43,5 (Oct 1992), 277–284.
Yao, A. C.C. New algorithms for bin packing. Journal of the ACM 27 (1980), 207–227.
Zhang, G. Worst-case analysis of the FFH algorithm for online variable-sized bin packing. Computing 56,2 (1996), 165–172.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seiden, S.S. (2000). An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds) Automata, Languages and Programming. ICALP 2000. Lecture Notes in Computer Science, vol 1853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45022-X_25
Download citation
DOI: https://doi.org/10.1007/3-540-45022-X_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67715-4
Online ISBN: 978-3-540-45022-1
eBook Packages: Springer Book Archive