S. 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

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

I. Schiermeyer, Reverse-Fit: A 2-optimal algorithm for packing rectangles, Lecture Notes in Computer Science, pp.290-290, 1994.
DOI : 10.1007/BFb0049416

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

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

K. Jansen and R. Solis-oba, New Approximability Results for 2-Dimensional Packing Problems, Lecture Notes in Computer Science, vol.4708, p.103, 2007.
DOI : 10.1007/978-3-540-74456-6_11

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

M. Bougeret, P. Dutot, K. Jansen, C. Otte, and D. Trystram, Approximation Algorithms for Multiple Strip Packing, Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA), 2009.
DOI : 10.1007/978-3-642-12450-1_4
URL : https://hal.archives-ouvertes.fr/hal-00953421

M. Garey and R. Graham, Bounds for Multiprocessor Scheduling with Resource Constraints, SIAM Journal on Computing, vol.4, issue.2, pp.187-200, 1975.
DOI : 10.1137/0204015

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

P. Dutot, F. Pascual, K. Rzadca, and D. Trystram, Approximation algorithms for the multi-organization scheduling problem, Submitted to: IEEE Transactions on Parallel and Distributed Systems (TPDS), 2010.
URL : https://hal.archives-ouvertes.fr/hal-00796861

P. Dutot, G. Mounié, and D. Trystram, Handbook of Scheduling, ch. Scheduling Parallel Tasks: Approximation Algorithms, 2004.

D. S. Hochbaum and D. B. Shmoys, A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach, SIAM Journal on Computing, vol.17, issue.3, pp.539-551, 1988.
DOI : 10.1137/0217033