N. Audsley, Optimal priority assignment and feasibility of static priority tasks with arbitrary start times, 1991.

N. Audsley, On priority assignment in fixed priority scheduling, Information Processing Letters, vol.79, issue.1, pp.39-44, 2001.
DOI : 10.1016/S0020-0190(00)00165-4

J. Goossens, Scheduling of offset free systems, Real-Time Systems, vol.24, issue.2, pp.239-258, 2003.
DOI : 10.1023/A:1021782503695
URL : https://hal.archives-ouvertes.fr/inria-00083863

J. Goossens and R. Devillers, The non-optimality of the monotonic priority assignements for hard real-time systems, Real-Time Systems, vol.13, issue.2, pp.107-126, 1997.
DOI : 10.1023/A:1007980022314

K. Jeffay, D. Stanat, and C. Martel, On non-preemptive scheduling of periodic and sporadic tasks, Proc. of the 12th IEEE Real-time Systems Symposium, 1991.

J. P. Lehoczky, Fixed priority scheduling of periodic task sets with arbitrary deadlines, [1990] Proceedings 11th Real-Time Systems Symposium, pp.201-213, 1990.
DOI : 10.1109/REAL.1990.128748

J. Leung and J. Whitehead, On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation, vol.2, issue.4, pp.237-250, 1982.
DOI : 10.1016/0166-5316(82)90024-4

C. Liu and J. Layland, Scheduling algorithms for multiprogramming in hard-real time environnement, Journal of the ACM, vol.20, issue.1, pp.40-61, 1973.

R. Saket and N. Navet, Frame packing algorithms for automotive applications Available as research report INRIA RR-4998, 2006.

K. Tindell, A. Burns, and A. Wellings, An extendible approach for analyzing fixed priority hard real-time tasks, Real-Time Systems, vol.4, issue.2, pp.133-151, 1994.
DOI : 10.1007/BF01088593