This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
August 1983 (vol. 32 no. 8)
pp. 697-707
B. Chazelle, Department of Computer Science, Brown University
We study implementations of the bottom-left heuristic for two-dimensional bin-packing. To pack N rectangles into an infinite vertical strip of fixed width, the strategy considered here places each rectangle in turn as low as possible in the strip in a left-justified position. For reasons of simplicity and good performance, the bottom-left heuristic has long been a favorite in practical applications; however, the best implementations found so far require a number of steps O(N3). In this paper, we present an implementation of the bottom-left heuristic which requires linear space and quadratic time. The algorithm is fairly practical, and we believe that even for relatively small values of N, it gives the most efficient implementation of the heuristic, to date. It proceeds by first determining all the possible locations where the next rectangle can fit, then selecting the lowest of them. It is optimal among all the algorithms based on this exhaustive strategy, and its generality makes it adaptable to different packing heuristics.
Index Terms:
scheduling, Bin packing, bottom-left heuristic, computational geometry, geometric pattern, matching, operations research, operating systems
Citation:
B. Chazelle, "The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation," IEEE Transactions on Computers, vol. 32, no. 8, pp. 697-707, Aug. 1983, doi:10.1109/TC.1983.1676307
Usage of this product signifies your acceptance of the Terms of Use.