Abstract
The two-dimensional strip packing problem consists of packing in a rectangular strip of width 1 and minimum height a set of n rectangles, where each rectangle has width \(0 < w \le 1\) and height \(0 < h \le h_{max}\). We consider the high-multiplicity version of the problem in which there are only K different types of rectangles. For the case when \(K = 3\), we give an algorithm providing a solution requiring at most height \(\frac{3}{2}h_{max} + \epsilon \) plus the height of an optimal solution, where \(\epsilon \) is any positive constant.
R. Solis-Oba—The work of this author was partially supported by a Discovery Grant (RGPIN-2020-06423) from the Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A full version of this paper is available at www.csd.uwo.ca/~ablochha/2DHMSPP.pdf.
References
Baker, B., Coffman, E., Rivest, R.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846–855 (1980)
Bloch-Hansen, A.: High multiplicity strip packing. Electronic Thesis and Dissertation Repository. 6559 (2019)
Coffman, E., Garey, M., Johnson, D., Tarjan, R.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9(4), 808–826 (1980)
Garey, M., Johnson, D.: Computers and Intractability. Freeman, San Francisco (1979)
Harren, R., van Stee, R.: Improved absolute approximation ratios for two-dimensional packing problems. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX/RANDOM -2009. LNCS, vol. 5687, pp. 177–189. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03685-9_14
Harren, R., Jansen, K., Prädel, L., Van Stee, R.: A (\(\frac{5}{3} + \epsilon \))-approximation for strip packing. Comput. Geom. 47(2), 248–267 (2014)
Karloff, H.: Linear Programming. Springer, Heidelberg (2008)
Jansen, K., Solis-Oba, R.: Rectangle packing with one-dimensional resource augmentation. Discret. Optim. 6(3), 310–323 (2009)
Karmarkar, N., Karp, R.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: 23rd Annual Symposium on Foundations of Computer Science, pp. 312–320. IEEE (1982)
Kenyon, C., Rémila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25(4), 645–656 (2000)
Schiermeyer, I.: Reverse-fit: a 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) Algorithms – ESA 1994. European Symposium on Algorithms, vol. 855, pp. 290–299. Springer, Berlin, Heidelberg (1994)
Sleator, D.: A 2.5 times optimal algorithm for packing in two dimensions. Inform. Process. Lett. 10(1), 37–40 (1980)
Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM J. Comput. 26(2), 401–409 (1997)
Yu, A.: High multiplicity strip packing problem with three rectangle types. Electronic Thesis and Dissertation Repository. 6684 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bloch-Hansen, A., Solis-Oba, R., Yu, A. (2022). High Multiplicity Strip Packing with Three Rectangle Types. In: Ljubić, I., Barahona, F., Dey, S.S., Mahjoub, A.R. (eds) Combinatorial Optimization. ISCO 2022. Lecture Notes in Computer Science, vol 13526. Springer, Cham. https://doi.org/10.1007/978-3-031-18530-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-18530-4_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-18529-8
Online ISBN: 978-3-031-18530-4
eBook Packages: Computer ScienceComputer Science (R0)