Abstract
We consider the two-dimensional bin packing problem given a set of rectangular items, find the minimal number of rectangular bins needed to pack all items. Rotation of the items is not permitted. We show for any integer \({k} \ge 3\) that at most \({k}-1\) bins are needed to pack all items if every item fits into a bin and if the total area of items does not exceed \({k}/4\)-times the bin area. Moreover, this bound is tight. Furthermore, we show that only two bins are necessary to pack all items if the total area of items is not larger than the bin area, and if the height of each item is not larger than a third of the bin height and the width of every item does not exceed half of the bin width.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Belov, G., Kartak, V., Rohling, H., & Scheithauer, G. (2009). One-dimensional relaxations and lp bounds for orthogonal packing. International Transactions in Operational Research, 16, 745–766.
Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., & Trystram, D. (2009). Approximation algorithm for multiple strip packing. IT University of Copenhagen, Denmark, 7th WAOA.
Buchwald, T., & Scheithauer, G., (2012). A note on, Relations between capacity utilization and minimal bin number. Preprint MATH-NM-05-2012, Technische Universität Dresden.
Carlier, J., Clautiaux, F., & Moukrim, A. (2007). New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Computers & Operations Research, 34, 2223–2250.
Coffman, E. G., Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4), 808–826.
Dyckhoff, H., & Finke, U. (1992). Cutting and packing in production and distribution. Heidelberg: Physica Verlag.
Fekete, S. P., & Schepers, J. (2004). A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60(2), 311–329.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman.
Hoffmann, K., Scheithauer, G. (2012). Relations between capacity utilization and minimal bin number. Preprint MATH-NM-03-2012, Technische Universität Dresden.
Jansen, K., & Zhang, G. (2007). Maximizing the total profit of rectangles packed into a rectangle. Algorithmica, 47, 323–342.
Li, K., & Cheng, K. H. (1990). On three-dimensional packing. SIAM Journal on Computing, 19(5), 847–867.
Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241–252.
Martello, S., & Vigo, D. (1998). Exact solution of the two-dimensional finite bin-packing problem. Management Science, 44, 388–399.
Meir, A., & Moser, L. (1968). On packing of squares and cubes. Journal of Combinatorial Theory, 5, 126–134.
Steinberg, A. (1997). A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26(2), 401–409.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Buchwald, T., Hoffmann, K. & Scheithauer, G. Relations between capacity utilization, minimal bin size and bin number. Ann Oper Res 217, 55–76 (2014). https://doi.org/10.1007/s10479-014-1572-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-014-1572-z