E. Angel, E. Bampis, and A. V. Fishkin, A note on scheduling to meet two min-sum objectives. Operation Research Letters, pp.69-73, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00341342

E. Angel, E. Bampis, and A. Kononov, A FPTAS for approximating the Pareto curve of the unrelated parallel machines scheduling problem with costs, LNCS, vol.2161, pp.194-205, 2001.

F. Baille, E. Bampis, and C. Laforest, A note on bicriteria schedules with optimal approximations ratios. Parallel processing letters, pp.315-323, 2004.

S. Campana, D. Barberis, F. Brochu, A. De-salvo, F. Donno et al., Analysis of the ATLAS Rome Production Experience on the LHC Computing Grid, First International Conference on e-Science and Grid Computing (e-Science'05), pp.82-89, 2005.
DOI : 10.1109/E-SCIENCE.2005.18

P. Choudhury, R. Kumar, and P. P. Chakrabarti, Hybrid Scheduling of Dynamic Task Graphs with Selective Duplication for Multiprocessors under Memory and Time Constraints, IEEE Transactions on Parallel and Distributed Systems, vol.19, issue.7, 2007.
DOI : 10.1109/TPDS.2007.70784

J. J. Dongarra, E. Jeannot, E. Saule, and Z. Shi, Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '07, pp.280-288, 2007.
DOI : 10.1145/1248377.1248423
URL : https://hal.archives-ouvertes.fr/hal-00155964

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

R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.
DOI : 10.1137/0117039

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

C. Laforest, A tricriteria approximation algorithm for steiner tree in graphs, 2001.

C. H. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access of Web sources, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.86-92, 2000.
DOI : 10.1109/SFCS.2000.892068

C. Wein and J. Stein, On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operational research letters, pp.115-122, 1997.