C. L. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environnment, Journal of the ACM, vol.20, issue.1, 1973.

S. Martello, E. G. Coffman, G. Galambos, and D. Vigo, Bin packing approximation algorithms: Combinatorial analysis . Handbook of combinatorial optimization, 1998.

A. Burns, K. Tindell, and A. Wellings, Effective analysis for engineering real-time fixed priority schedulers, IEEE Transactions on Software Engineering, vol.21, issue.5, pp.475-480, 1995.
DOI : 10.1109/32.387477

J. Echague, I. Ripoll, and A. Crespo, Hard real-time preemptively scheduling with high context switch cost, Proceedings Seventh Euromicro Workshop on Real-Time Systems, 1995.
DOI : 10.1109/EMWRTS.1995.514310

A. Burns, Preemptive priority-based scheduling: An appropriate engineering approach, Advances in Real-Time Systems, chapter 10, pp.225-248, 1994.

Y. Wang and M. Saksena, Scheduling fixed-priority tasks with preemption threshold, Proceedings of the 6 International Conference on Real-Time Computing Systems and Applications , RTCSA'99, 1999.

M. Saksena and Y. Wang, Scalable real-time system design using preemption thresholds, Proceedings 21st IEEE Real-Time Systems Symposium, 2000.
DOI : 10.1109/REAL.2000.895993
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4420

P. , M. Yomsi, and Y. Sorel, Extending rate monotonic analysis with exact cost of preemptions for hard real-time systems, Proceedings of 19th Euromicro Conference on Real-Time Systems, ECRTS'07, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00413487

P. , M. Yomsi, and Y. Sorel, An algebraic approach for fixed-priority scheduling of hard real-time systems with exact preemption cost, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00613347

I. Robert, A. Davis, and . Burns, A survey of hard real-time scheduling algorithms and schedulability analysis techniques for multiprocessor systems, 2009.

O. U. Zapata and P. M. Alvarez, Edf and rm multiprocessor scheduling algorithms: Survey and performance evaluation, 2005.

J. Garey, Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, 1979.

S. K. Dhall and C. L. Liu, On a Real-Time Scheduling Problem, Operations Research, vol.26, issue.1, 1978.
DOI : 10.1287/opre.26.1.127

Y. Oh and S. H. Son, Tight performance bounds of heuristics for a real-time scheduling problem, 1993.

L. George, I. Lupu, P. Courbin, and J. Goossens, Multi-criteria evaluation of partitioning schemes for real-time systems, The 15th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA'10, 2010.

F. Ndoye and Y. Sorel, Preemptive multiprocessor real-time scheduling with exact preemption cost, Proceedings of 5th Junior Researcher Workshop on Real-Time Computing conjunction with the 18th International conference on Real-Time and Network Systems, 2011.

S. Katoa and N. Yammasaki, Semi-partitioning technique for multiprocessor real-time scheduling, Proceedings of WIP Session of the 29th Real-Time Systems Symposium (RTSS), 2008.

J. H. Anderson, V. Bud, and C. U. Devi, An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems, 17th Euromicro Conference on Real-Time Systems (ECRTS'05), pp.199-208, 2005.
DOI : 10.1109/ECRTS.2005.6

J. E. Mitchell, Branch-and-cut algorithms for combinatorial optimization problems, pp.65-67, 2002.

J. Goossens, Scheduling of Hard Real-Time Periodic Systems with Various Kinds of Deadline and Offset Constraints, 1999.

P. Meumeu-yomsi, L. George, Y. Sorel, and D. De-rauglaudre, Improving the quality of control of periodic tasks scheduled by fp with an asynchronous approach, International Journal on Advances in Systems and Measurements, vol.2, issue.2, 2009.

K. M. Chandy, L. T. Adams, and J. R. Dickson, A comparison of list schedules for parallel processing systems, Commun. ACM, vol.17, pp.685-690, 1974.