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

M. Bougeret, P. F. Dutot, K. Jansen, C. Otte, and D. Trystram, A low cost 5/2 approximation for scheduling rigid jobs on multiple organizations, 6th IFIP International Conference on Theoretical Computer Science, 2009.

M. Bougeret, P. F. Dutot, K. Jansen, C. Otte, and D. Trystram, A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling, Euro-Par 2010, 2010.
DOI : 10.1007/978-3-642-15277-1_16
URL : https://hal.archives-ouvertes.fr/hal-00738518

J. Du and J. Leung, Complexity of Scheduling Parallel Task Systems, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.473-487, 1989.
DOI : 10.1137/0402042

L. A. Hall and D. B. Shmoys, Approximation schemes for constrained scheduling problems, 30th Annual Symposium on Foundations of Computer Science, pp.134-139, 1989.
DOI : 10.1109/SFCS.1989.63468

R. Harren, K. Jansen, L. Prädel, and R. Van-stee, A 5/3 + ? approximation for strip packing. To appear in: The 12th Symposium on Algorithms and Data Structures, 2011.

K. Jansen, Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme, Algorithmica, vol.39, issue.1, pp.59-81, 2004.
DOI : 10.1007/s00453-003-1078-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.2717

K. Jansen, Approximation algorithms for min-max and max-min resource sharing problems and applications. Efficient Approximation and Online Algorithms, Lecture Notes in Computer Science, vol.3483, pp.156-202, 2006.

K. Jansen and L. Porkolab, Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks, Algorithmica, vol.32, issue.3, pp.507-520, 2002.
DOI : 10.1007/s00453-001-0085-8

K. Jansen and R. Solis-oba, New Approximability Results for 2-Dimensional Packing Problems, Mathematical Foundations of Computer Science, pp.103-114, 2007.
DOI : 10.1007/978-3-540-74456-6_11

K. Jansen and R. Thöle, Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2, International Colloquium on Automata, Languages and Programming, pp.234-245, 2008.
DOI : 10.1007/978-3-540-70575-8_20

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

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

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

L. G. Khachiyan, M. D. Grigoriadis, L. Porkolab, and J. Villavicencio, Approximate max-min resource sharing for structured concave optimization, SIAM Journal on Optimization, vol.11, pp.1081-1091, 2001.

E. L. Lawler, Fast Approximation Algorithms for Knapsack Problems, Mathematics of Operations Research, vol.4, issue.4, pp.339-356, 1979.
DOI : 10.1287/moor.4.4.339

J. K. Lenstra and D. B. Shmoys, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, vol.23, issue.1-3, pp.259-271, 1990.
DOI : 10.1007/BF01585745
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.708

G. Mounié, C. Rapine, and D. Trystram, Efficient approximation algorithms for scheduling malleable tasks, Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures , SPAA '99, pp.23-32, 1999.
DOI : 10.1145/305619.305622

S. A. Plotkin, D. B. Shmoys, and ´. E. Tardos, Fast Approximation Algorithms for Fractional Packing and Covering Problems, Mathematics of Operations Research, vol.20, issue.2, pp.257-301, 1995.
DOI : 10.1287/moor.20.2.257

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

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, 6th International Conference on Parallel Processing and Applied Mathematics (PPAM 2005), 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