. Bdj-+-09-]-m, P. Bougeret, K. Dutot, C. Jansen, D. Otte et al., Approximation algorithm for multiple strip packing, Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA), 2009.

. Bdj-+-10-]-m, P. Bougeret, K. Dutot, C. Jansen, D. Otte et al., Approximating the non-contiguous multiple organization packing problem, Proceedings of the 6th IFIP International Conference on Theoretical Computer Science (TCS), 2010.

D. [. Hochbaum and . Shmoys, Using dual approximation algorithms for scheduling problems theoretical and practical results, Journal of the ACM, vol.34, issue.1, pp.144-162, 1987.
DOI : 10.1145/7531.7535

D. [. Hochbaum and . 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

]. K. Jan09 and . Jansen, An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables, Automata, Languages and Programming, pp.562-573, 2009.

A. [. Schwiegelshohn, R. Tchernykh, and . Yahyapour, Online scheduling in grids, 2008 IEEE International Symposium on Parallel and Distributed Processing, pp.1-10, 2008.
DOI : 10.1109/IPDPS.2008.4536273

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