N. Bansal, A. Caprara, K. Jansen, L. Prädel, and M. Sviridenko, How to maximize the total area of rectangle packed into a rectangle, The 20th International Symposium on Algorithms and Computation, 2009.

N. Bansal, X. Han, K. Iwama, M. Sviridenko, and G. Zhang, Harmonic algorithm for 3-dimensional strip packing problem, Proceedings of the eighteenth ACM-SIAM symposium on Discrete algorithm, pp.1197-1206, 2007.

A. Caprara, Packing 2-dimensional bins in harmony, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.490-499, 2002.
DOI : 10.1109/SFCS.2002.1181973

A. Caprara, A. Lodi, and M. Monaci, An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem, Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization, pp.315-328, 2002.
DOI : 10.1007/3-540-47867-1_23

K. Jansen, L. Prädel, and U. M. Schwarz, Two for One: Tight Approximation of 2D Bin Packing, Algorithms and Data Structures Symposium, 2009.
DOI : 10.1137/0117039

K. Jansen and R. Solis-oba, An asymptotic approximation algorithm for 3D-strip packing, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.143-152, 2006.
DOI : 10.1145/1109557.1109575

K. Jansen and R. Solis-oba, New Approximability Results for 2-Dimensional Packing Problems, In Journal of Discrete Optimization, vol.6, pp.310-323, 2009.
DOI : 10.1007/978-3-540-74456-6_11

E. G. Coffman-jr, M. R. Garey, D. S. Johnson, and R. E. Tarjan, Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms, SIAM Journal on Computing, vol.9, issue.4, pp.808-826, 1980.
DOI : 10.1137/0209062

C. Kenyon and E. Rémila, A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem, Mathematics of Operations Research, vol.25, issue.4, pp.645-656, 2000.
DOI : 10.1287/moor.25.4.645.12118
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.943

F. Miyazawa and Y. Wakabayashi, Cube packing, In Latin Theoretical Informatics, pp.58-67, 2000.
DOI : 10.1007/10719839_6

I. Schiermeyer, Reverse-Fit: A 2-optimal algorithm for packing rectangles, Proceedings of the Second European Symposium on Algorithms, pp.290-299, 1994.
DOI : 10.1007/BFb0049416

U. Schwiegelshohn, A. Tchernykh, and R. Yahyapour, Online scheduling in grids, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-10, 2008.
DOI : 10.1109/IPDPS.2008.4536273
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.571.6038

A. Steinberg, A Strip-Packing Algorithm with Absolute Performance Bound 2, SIAM Journal on Computing, vol.26, issue.2, pp.401-409, 1997.
DOI : 10.1137/S0097539793255801

A. Tchernykh, J. Ramírez, A. Avetisyan, N. Kuzjurin, D. Grushin et al., Two Level Job-Scheduling Strategies for a Computational Grid, PPAM, pp.774-781, 2005.
DOI : 10.1007/11752578_93

D. Ye, X. Han, and G. Zhang, On-Line Multiple-Strip Packing, The 3rd Annual International Conference on Combinatorial Optimization and Applications, 2009.
DOI : 10.1007/978-3-642-02026-1_14

S. N. Zhuk, Approximate algorithms to pack rectangles into several strips, Discrete Mathematics and Applications, vol.16, issue.1, pp.73-85, 2006.
DOI : 10.1515/156939206776241264