@article{Zhuk,
  title={{Approximate algorithms to pack rectangles into several strips}},
  author={Zhuk, SN},
  journal={Discrete Mathematics and Applications},
  volume={16},
  number={1},
  pages={73--85},
  year={2006},
  publisher={Walter de Gruyter Genthiner Strasse 13 10875 Berlin Germany}
}


@conference{OnlineMSP,
  title={{On-Line Multiple-Strip Packing}},
  author={Ye, D. and Han, X. and Zhang, G.},
  booktitle={Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications},
  pages={165},
  year={2009},
  organization={Springer}
}


@article{Steinberg,
  title={{A strip-packing algorithm with absolute performance bound 2}},
  author={Steinberg, A.},
  journal={SIAM Journal on Computing},
  volume={26},
  pages={401},
  year={1997}
}


@article{schiermeyer1994reverse,
  title={{Reverse-fit: A 2-optimal algorithm for packing rectangles}},
  author={Schiermeyer, I.},
  journal={Lecture Notes in Computer Science},
  pages={290--290},
  year={1994},
  publisher={Springer}
}
 

@article{kenyon2000near,
  title={{A near-optimal solution to a two-dimensional cutting stock problem}},
  author={Kenyon, C. and R{\'e}mila, E.},
  journal={Mathematics of Operations Research},
  pages={645--656},
  year={2000},
  publisher={Institute for Operations Research and the Management Sciences}
}

@article{DBLP:journals/siamcomp/CoffmanGJT80,
  title={{Performance bounds for level-oriented two-dimensional packing algorithms}},
  author={Coffman Jr, EG and Garey, MR and Johnson, DS and Tarjan, RE},
  journal = {SIAM J. Comput.},
  volume={9},
  pages={808},
  year={1980}
}

 @article{DBLP:conf/mfcs/JansenS07,
  title={{New approximability results for 2-dimensional packing problems}},
  author={Jansen, K. and Solis-Oba, R.},
  journal={Lecture Notes in Computer Science},
  volume={4708},
  pages={103},
  year={2007},
  publisher={Springer}
}



@InProceedings{schwiegelshohn2008osg,
  author = 	 {Schwiegelshohn, U. and Tchernykh, A. and Yahyapour, R.},
  title = 	 {{Online scheduling in grids}},
  booktitle = {Proceedings of IPDPS},
  pages = 	 {1--10},
  year = 	 2008}

@article{q|_|cmax_ptas_3/2dual,
 author = {Dorit S. Hochbaum and David B. Shmoys},
 title = {A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach},
 journal = {SIAM J. Comput.},
 volume = {17},
 number = {3},
 year = {1988},
 issn = {0097-5397},
 pages = {539--551},
 doi = {http://dx.doi.org/10.1137/0217033},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 annote = {Le papier 3/2 plus ptas qcmax, dispo papier seulement},
 }

@Article{2_approx_MSP,
  author = 	 {Bougeret, M. and Dutot, P-F. and Jansen, K. and Otte, C. and Trystram, D.},
  title = 	 {Approximation Algorithm for Multiple Strip Packing},
  journal =      {Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA)},
  year= 2009}


@InBook{dutot_mounie_trystram_handbook,
  author = 	 {Dutot, P-F. and Mouni{\'e}, G. and Trystram, D.},
  title = 	 {Handbook of Scheduling},
  chapter = 	 {{Scheduling Parallel Tasks: Approximation Algorithms}},
  publisher = 	 {CRC Press},
  year = 	 2004}

@article{graham_resource_constraint,
  title={{Bounds for multiprocessor scheduling with resource constraints}},
  author={Garey, MR and Graham, R.L.},
  journal={SIAM J. Comput.},
  volume={4},
  number={2},
  pages={187--200},
  year={1975},
  publisher={Citeseer}
}


 @Article{MOCCAconcurrency08,
  author = 	 {Dutot, P-F. and Pascual, F. and Rzadca, K. and Trystram, D.},
  title = 	 {Approximation algorithms for the Multi-Organization Scheduling Problem},
  journal = 	 {Submitted to: IEEE Transactions on Parallel and Distributed Systems (TPDS)},
  year =         2010,
  OPTkey = 	 {},
  OPTvolume = 	 {},
  OPTnumber = 	 {},
  OPTpages = 	 {},
  OPTmonth = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {}
}