\begin{thebibliography}{10}

\bibitem{Zhuk}
S.~Zhuk, ``{Approximate algorithms to pack rectangles into several strips},''
  {\em Discrete Mathematics and Applications}, vol.~16, no.~1, pp.~73--85,
  2006.

\bibitem{DBLP:journals/siamcomp/CoffmanGJT80}
E.~Coffman~Jr, M.~Garey, D.~Johnson, and R.~Tarjan, ``{Performance bounds for
  level-oriented two-dimensional packing algorithms},'' {\em SIAM J. Comput.},
  vol.~9, p.~808, 1980.

\bibitem{schiermeyer1994reverse}
I.~Schiermeyer, ``{Reverse-fit: A 2-optimal algorithm for packing
  rectangles},'' {\em Lecture Notes in Computer Science}, pp.~290--290, 1994.

\bibitem{Steinberg}
A.~Steinberg, ``{A strip-packing algorithm with absolute performance bound
  2},'' {\em SIAM Journal on Computing}, vol.~26, p.~401, 1997.

\bibitem{kenyon2000near}
C.~Kenyon and E.~R{\'e}mila, ``{A near-optimal solution to a two-dimensional
  cutting stock problem},'' {\em Mathematics of Operations Research},
  pp.~645--656, 2000.

\bibitem{DBLP:conf/mfcs/JansenS07}
K.~Jansen and R.~Solis-Oba, ``{New approximability results for 2-dimensional
  packing problems},'' {\em Lecture Notes in Computer Science}, vol.~4708,
  p.~103, 2007.

\bibitem{OnlineMSP}
D.~Ye, X.~Han, and G.~Zhang, ``{On-Line Multiple-Strip Packing},'' in {\em
  Proceedings of the 3rd International Conference on Combinatorial Optimization
  and Applications}, p.~165, Springer, 2009.

\bibitem{2_approx_MSP}
M.~Bougeret, P.-F. Dutot, K.~Jansen, C.~Otte, and D.~Trystram, ``Approximation
  algorithm for multiple strip packing,'' {\em Proceedings of the 7th Workshop
  on Approximation and Online Algorithms (WAOA)}, 2009.

\bibitem{graham_resource_constraint}
M.~Garey and R.~Graham, ``{Bounds for multiprocessor scheduling with resource
  constraints},'' {\em SIAM J. Comput.}, vol.~4, no.~2, pp.~187--200, 1975.

\bibitem{schwiegelshohn2008osg}
U.~Schwiegelshohn, A.~Tchernykh, and R.~Yahyapour, ``{Online scheduling in
  grids},'' in {\em Proceedings of IPDPS}, pp.~1--10, 2008.

\bibitem{MOCCAconcurrency08}
P.-F. Dutot, F.~Pascual, K.~Rzadca, and D.~Trystram, ``Approximation algorithms
  for the multi-organization scheduling problem,'' {\em Submitted to: IEEE
  Transactions on Parallel and Distributed Systems (TPDS)}, 2010.

\bibitem{dutot_mounie_trystram_handbook}
P.-F. Dutot, G.~Mouni{\'e}, and D.~Trystram, {\em Handbook of Scheduling},
  ch.~{Scheduling Parallel Tasks: Approximation Algorithms}.
\newblock CRC Press, 2004.

\bibitem{q|_|cmax_ptas_3/2dual}
D.~S. Hochbaum and D.~B. Shmoys, ``A polynomial approximation scheme for
  scheduling on uniform processors: Using the dual approximation approach,''
  {\em SIAM J. Comput.}, vol.~17, no.~3, pp.~539--551, 1988.

\end{thebibliography}
