A. Agnetis, P. B. Mirchandani, D. Pacciarelli, and A. Pacifici, Scheduling Problems with Two Competing Agents, Operations Research, vol.52, issue.2, pp.229-242, 2004.
DOI : 10.1287/opre.1030.0092

E. Angel, E. Bampis, and L. Gourvès, Approximation results for a bicriteria job scheduling problem on a single machine without preemption, Information Processing Letters, vol.94, issue.1, pp.19-27, 2005.
DOI : 10.1016/j.ipl.2004.12.007
URL : https://hal.archives-ouvertes.fr/hal-00341347

A. Archer, C. Papadimitriou, K. Talwar, and E. Tardos, An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents, Proc. of the 14th Annual ACM Symposium on Discrete Algorithms, 2003.
DOI : 10.1080/15427951.2004.10129086

K. Baker and J. Smith, A multiple-criterion model for machine scheduling, Journal of Scheduling, vol.6, issue.1, pp.7-16, 2003.
DOI : 10.1023/A:1022231419049

M. A. Bender, S. Muthukrishnan, and R. Rajaraman, Improved algorithms for stretch scheduling, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.762-771, 2002.

M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, 1979.

R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.
DOI : 10.1002/j.1538-7305.1966.tb01709.x

L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms, SODA: ACM- SIAM Symposium on Discrete Algorithms, 1997.
DOI : 10.1287/moor.22.3.513

D. S. Hochbaum and D. B. 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. Jackson, Q. Snell, and M. Clement, Core Algorithms of the Maui Scheduler, Proc. of the 7th International workshop JSSPP, number 2221 in LNCS, 2001.
DOI : 10.1007/3-540-45540-X_6

H. Kellerer, Algorithms for multiprocessor scheduling with machine release times, IIE Transactions, vol.45, issue.11, pp.991-999, 1998.
DOI : 10.1287/opre.46.3.S1

A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of biological requests, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '06, 2006.
DOI : 10.1145/1148109.1148124
URL : https://hal.archives-ouvertes.fr/inria-00070293

A. Legrand and C. Touati, Non-Cooperative Scheduling of Multiple Bag-of-Task Applications, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.427-435, 2007.
DOI : 10.1109/INFCOM.2007.57
URL : https://hal.archives-ouvertes.fr/inria-00153577

J. Y. Leung, Some basic scheduling algorithms, 2004.

J. Mo and J. Warland, Fair end-to-end window-based congestion control, Proc. of SPIE '98: International Symposium on Voice, Video and Data Communications, 1998.
DOI : 10.1109/90.879343
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.3766

M. J. Osborne and A. Rubinstein, A Course in Game Theory, 1994.

F. Pascual, K. Rzadca, and D. Trystram, Cooperation in multi-organization scheduling, Proc. of EuroPar number 4641 in LNCS, pp.224-233, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00689789