K. Albers and F. Slomka, An event stream driven approximation for the analysis of real-time systems, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004., pp.187-195, 2004.
DOI : 10.1109/EMRTS.2004.1311020

S. Anand, N. Garg, and N. Megow, Meeting Deadlines: How Much Speed Suffices?, Proceedings of 38th International Colloquium on Automata, Languages and Programming, pp.232-243, 2011.
DOI : 10.1007/s00453-001-0068-9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.230.2007

B. Andersson and E. Tovar, Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors, 2007 IEEE International Parallel and Distributed Processing Symposium, pp.1-8, 2007.
DOI : 10.1109/IPDPS.2007.370337

A. Asadpour, U. Feige, and A. Saberi, Santa Claus Meets Hypergraph Matchings, Lecture Notes in Computer Science, vol.5171, pp.10-20, 2008.
DOI : 10.1007/978-3-540-85363-3_2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.3137

B. Awerbuch, Y. Azar, E. F. Grove, M. Kao, P. Krishnan et al., Load balancing in the L/sub p/ norm, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.383-391, 1995.
DOI : 10.1109/SFCS.1995.492494

Y. Azar and A. Epstein, Convex programming for scheduling unrelated parallel machines, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing , STOC '05, pp.331-337, 2005.
DOI : 10.1145/1060590.1060639

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3081

T. P. Baker and S. K. Baruah, Schedulability analysis of multiprocessor sporadic task systems In: Handbook of Real-Time and Embedded Systems, chapter 3, 2007.

N. Bansal and M. Sviridenko, The Santa Claus problem, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.31-40, 2006.
DOI : 10.1145/1132516.1132522

S. Baruah and N. Fisher, The Partitioned Multiprocessor Scheduling of Sporadic Task Systems, 26th IEEE International Real-Time Systems Symposium (RTSS'05), pp.321-329, 2005.
DOI : 10.1109/RTSS.2005.40

S. Baruah, A. Mok, and L. Rosier, Preemptively scheduling hard-real-time sporadic tasks on one processor, [1990] Proceedings 11th Real-Time Systems Symposium, pp.182-190, 1990.
DOI : 10.1109/REAL.1990.128746

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.207

S. K. Baruah, V. Bonifaci, A. Marchetti-spaccamela, and S. Stiller, Improved multiprocessor global schedulability analysis. Real-Time Syst, pp.3-24, 2010.
DOI : 10.1007/s11241-010-9096-3

S. K. Baruah and K. Pruhs, Open problems in real-time scheduling, Journal of Scheduling, vol.20, issue.1, pp.577-582, 2010.
DOI : 10.1007/BF01995675

V. Bonifaci, A. Marchetti-spaccamela, and S. Stiller, A constant-approximate feasibility test for multiprocessor real-time scheduling, Algorithmica, vol.62, pp.3-4, 2012.
DOI : 10.1007/978-3-540-87744-8_18

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.8758

S. Chakraborty, S. Künzli, and L. Thiele, Approximate schedulability analysis, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002., pp.159-168, 2002.
DOI : 10.1109/REAL.2002.1181571

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.9681

J. Chen and S. Chakraborty, Resource Augmentation Bounds for Approximate Demand Bound Functions, 2011 IEEE 32nd Real-Time Systems Symposium, pp.272-281, 2011.
DOI : 10.1109/RTSS.2011.32

T. Ebenlendr, M. Kr?ál, and J. Sgall, Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines, Proceedings of 19th Symposium on Discrete Algorithms, pp.483-490, 2008.
DOI : 10.1007/978-3-642-23719-5_45

F. Eisenbrand, T. Rothvoß, L. Aceto, I. Damgård, M. M. Halldórsson et al., A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation, Proceedings of 35th International Colloquium on Automata, Languages and Programming, pp.246-257, 2008.
DOI : 10.1007/978-3-540-70575-8_21

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.229.2615

F. Eisenbrand and T. Rothvoß, EDF-schedulability of synchronous periodic task systems is coNP-hard, Proceedings of 21st Symposium on Discrete Algorithms, pp.1029-1034, 2010.
DOI : 10.1137/1.9781611973075.83

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5423

N. Fisher, S. Baruah, and T. P. Baker, The partitioned scheduling of sporadic tasks according to staticpriorities, Proceedings of 18th Euromicro Conference on Real-Time Systems, pp.118-127, 2006.

K. Jansen and L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, Proceedings of 31st Symposium on Theory of Computing, pp.408-417, 1999.
DOI : 10.1145/301250.301361

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4190

H. Karloff, Linear Programming, Birkhäuser, 1991.
DOI : 10.1007/978-0-8176-4844-2

R. M. Karp, Reducibility among combinatorial problems, Complex. Comput. Comput, vol.40, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani et al., Global wire routing in two-dimensional arrays, Algorithmica, vol.2, issue.1-4, pp.113-129, 1987.
DOI : 10.1007/BFb0121044

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.7841

A. Kumar, V. S. Marathe, M. V. Parthasarathy, S. Srinivasan, and A. , Approximation Algorithms for Scheduling on Multiple Machines, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.254-263, 2005.
DOI : 10.1109/SFCS.2005.21

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.4242

L. C. Lau, R. Ravi, and M. Singh, Iterative Methods in Combinatorial Optimization, 2011.
DOI : 10.1017/CBO9780511977152

J. K. Lenstra, D. B. Shmoys, and É. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Math. Program, vol.46, pp.1-3, 1990.
DOI : 10.1109/sfcs.1987.8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.708

C. Liu and J. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM, vol.20, issue.1, pp.46-61, 1973.
DOI : 10.1145/321738.321743

C. A. Phillips, C. Stein, E. Torng, and J. Wein, Optimal Time-Critical Scheduling via Resource Augmentation, Algorithmica, vol.32, issue.2, pp.163-200, 2002.
DOI : 10.1007/s00453-001-0068-9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.735

G. Raravi, B. Andersson, and K. Bletsas, Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors. Real-Time Syst, pp.29-72, 2013.

G. Raravi and V. Nélis, A PTAS for Assigning Sporadic Tasks on Two-type Heterogeneous Multiprocessors, 2012 IEEE 33rd Real-Time Systems Symposium, pp.117-126, 2012.
DOI : 10.1109/RTSS.2012.64

D. B. Shmoys and É. Tardos, An approximation algorithm for the generalized assignment problem, Mathematical Programming, vol.46, issue.1-3, pp.461-474, 1993.
DOI : 10.1007/BF01585178

O. Svensson, Santa Claus schedules jobs on unrelated machines, J. Comput, vol.41, issue.5, pp.1318-1341, 2012.
DOI : 10.1145/1993636.1993718

URL : http://arxiv.org/abs/1011.1168

A. Wiese, V. Bonifaci, and S. Baruah, Partitioned EDF scheduling on a few types of unrelated multiprocessors . Real-Time Syst, pp.219-238, 2013.

D. P. Williamson and D. B. Shmoys, The Design of Approximation Algorithms, 2011.
DOI : 10.1017/CBO9780511921735