Summary
An on-line algorithm for variable-sized bin packing with an asymptotical worst-case ratio of <1.7 is given. The method is derived from the Harmonic Fit proposed by Lee and Lee. It is proven that, if it is allowed to choose any bin sizes, then with an appropriately chosen second bin size we can have an asymptotical worst-case ratio of 1.4, even with the same algorithm and two bin sizes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brown, D.J.: A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. No. R-864. Coordinated Sci. Lab., Univ. of Illinois, Urbana, Ill., 1979
Friesen, D.K., Langston, M.A.: A storage-size selection problem. Inf. Process. Lett. 18, 295–296 (1984)
Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM J. Comput. 15, 222–230 (1986)
Kinnersley, N.G., Langston, M.A.: Online variable-sized bin packing. Discr. Appl. Math. 22, 143–148 (1988/89)
Liang, F.M.: A lower bound for on-line bin packing. Inf. Process. Lett. 10, 76–79 (1980)
Lee, C.C., Lee, D.T.: A simple on-line bin packing algorithm. J. ACM 32, 562–572 (1985)
Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM J. Comput. 16, 149–161 (1987)
Author information
Authors and Affiliations
Additional information
Part of this work was carried out when the author was visiting the Institut für Informatik und angewandte Mathematik, Berne, Switzerland
This paper has been supported by Grant OTKA Nr. 1135 from the Hungarian Academy of Sciences
Rights and permissions
About this article
Cite this article
Csirik, J. An on-line algorithm for variable-sized bin packing. Acta Informatica 26, 697–709 (1989). https://doi.org/10.1007/BF00289157
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289157