A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Scheduling independent multiprocessor tasks, vol.32, pp.247-261, 2002.

F. Baille, E. Bampis, C. Laforest, and C. Rapine, Bicriteria scheduling for contiguous and non contiguous parallel tasks, Annals of Operations Research, vol.159, pp.97-106, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00341364

C. Bierwirth and F. Meisel, A survey of berth allocation and quay crane scheduling problems in container terminals, European Journal of Operational Research, vol.202, issue.3, pp.615-627, 2010.

I. B??dek, M. Drozdowski, F. Guinand, and X. Schepler, On contiguous and non-contiguous parallel task scheduling, 2013.

S. H. Bokhari and D. M. Nicol, Balancing contention and synchronization on the Intel Paragon, IEEE Concurrency, vol.5, issue.2, pp.74-83, 1997.

D. P. Bunde, V. J. Leung, and J. Mache, Communication patterns and allocation strategies, Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS'04, p.248, 2004.

M. Chen and K. G. Shin, Processor allocation in an n-cube multiprocessor using Gray codes, IEEE Transactions on Computers, vol.36, issue.12, pp.1396-1407, 1987.

E. F. Codd, Multiprogram scheduling: Parts 1 and 2. Introduction and theory, Communications of the ACM, vol.3, issue.6, pp.347-350, 1960.

E. G. Coffman, 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.

M. Drozdowski, Scheduling for parallel processing, 2009.

P. F. Dutot, G. Mounié, and D. Trystram, Handbook of scheduling: Algorithms, models, and performance analysis, vol.24, pp.26-27, 2004.

D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. Sevcik, and P. Wong, Theory and practice in parallel job scheduling, Job scheduling strategies for parallel processing, vol.1291, pp.1-34, 1997.

M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, 1979.

R. Harren, K. Jansen, L. Pradel, and R. Van-stee, A (5/3+?)-approximation for strip packing, Computational Geometry, vol.47, issue.2, pp.248-267, 2014.

C. Kenyon and E. Rémila, A near-optimal solution to a twodimensional cutting stock problem, Mathematics of Operations Research, vol.25, issue.4, pp.645-656, 2000.

V. J. Leung, E. M. Arkin, M. A. Bender, D. Bunde, J. Johnston et al., Processor allocation on Cplant: Achieving general processor locality using one-dimensional allocation strategies, Proceedings of the IEEE International Conference on Cluster Computing, pp.296-304, 2002.

K. Li and K. Cheng, Job scheduling in a partitionable mesh using a two-dimensional buddy system partitioning scheme, IEEE Transactions on Parallel and Distributed Systems, vol.2, issue.4, pp.413-423, 1991.

A. Lim, The berth planning problem, Operations Research Letters, vol.22, issue.2-3, pp.105-110, 1998.

E. L. Lloyd, Concurrent task systems, Operations Research, vol.29, issue.1, pp.189-201, 1981.

V. Lo, K. J. Windisch, W. Liu, and B. Nitzberg, Noncontiguous processor allocation algorithms for mesh-connected multicomputers, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.7, pp.712-726, 1997.

N. Ntene and J. H. Van-vuuren, A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem, Discrete Optimization, vol.6, issue.2, pp.174-188, 2009.

A. Steinberg, A strip-packing algorithm with absolute performance bound 2, SIAM Journal on Computing, vol.26, issue.2, pp.401-409, 1997.

J. Turek, J. L. Wolf, and P. S. Yu, Approximate algorithms for scheduling parallelizable tasks, Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'92), pp.323-332, 1992.

B. Veltman, B. J. Lageweg, and J. K. Lenstra, Multiprocessor scheduling with communications delays, Parallel Computing, vol.16, pp.173-182, 1990.