1. Approximation algorithms for bin packing—an updated survey;Coffman,1984
2. Static job scheduling in partitionable mesh connected systems;Li;Journal of Parallel and Distributed Computing,1990
3. Johnson DS. Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA; 1973.
4. A near-optimal solution to a two-dimensional cutting stock problem;Kenyon;Mathematics of Operations Research,2000
5. On packing two-dimensional bins;Chung;SIAM Journal on Algebraic and Discrete Methods,1982