We study an online multiple-strip packing problem, whose goal is to pack the given rectangles into m vertical strips of unit width such that the maximum height used among the strips is minimized. Rectangles arrive one by one. The decision of delivering the rectangles to a strip as well as packing them into the strip must be done immediately and irrevocably without any information on the next rectangles. Both randomized and deterministic online algorithms are investigated, all of which are guaranteed a constant competitive ratio. © 2009 Elsevier B.V. All rights reserved.
Ye, D., Han, X., & Zhang, G. (2011). Online multiple-strip packing. In Theoretical Computer Science (Vol. 412, pp. 233–239). https://doi.org/10.1016/j.tcs.2009.09.029