B. S. Baker, D. J. Brown, and H. P. Katseff, A algorithm for two-dimensional packing, Journal of Algorithms, vol.2, issue.4, pp.348-368, 1981.
DOI : 10.1016/0196-6774(81)90034-1

B. S. Baker and J. S. Schwarz, Shelf Algorithms for Two-Dimensional Packing Problems, SIAM Journal on Computing, vol.12, issue.3, pp.508-525, 1983.
DOI : 10.1137/0212033

J. Blazewicz, J. K. Lenstra, and A. H. Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics, vol.5, issue.1, pp.11-24, 1983.
DOI : 10.1016/0166-218X(83)90012-4

E. G. Coffman, J. , D. S. Johnson, P. W. Shor, and G. S. Lueker, Probabilistic Analysis of Packing and Related Partitioning Problems, Probability and Algorithms, pp.87-107, 1992.
DOI : 10.1214/ss/1177011082

H. A. David, Order Statistics, 1970.

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

I. Golan, Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms, SIAM Journal on Computing, vol.10, issue.3, pp.571-582, 1981.
DOI : 10.1137/0210042

R. Krishnamurti and E. Ma, An approximation algorithm for scheduling tasks on varying partition sizes in partitionable multiprocessor systems, IEEE Transactions on Computers, vol.41, issue.12, 1990.
DOI : 10.1109/12.214665