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

N. C. Audsley, A. Burns, M. Richardson, and A. J. Wellings, Applying new scheduling theory to static priority pre-emptive scheduling, Software Engineering Journal, vol.8, issue.5, pp.284-292, 1993.
DOI : 10.1049/sej.1993.0034

T. P. Baker, Stack-based Scheduling of Real-Time Processes, Real-Time Systems Journal, vol.1, issue.3, pp.67-100, 1991.

S. Baruah and A. Burns, Sustainable Scheduling Analysis, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06), pp.159-168, 2006.
DOI : 10.1109/RTSS.2006.47

S. Baruah and A. Burns, Quantifying the sub-optimality of uniprocessor fixed priority scheduling, Proceedings of the IEEE International conference on Real-Time and Network Systems, pp.89-95, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00336484

S. K. Baruah, A. K. Mok, L. E. Rosier, S. K. Baruah, L. E. Rosier et al., 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

E. Bini and G. C. Buttazzo, Measuring the Performance of Schedulability Tests, Real-Time Systems, vol.20, issue.1, pp.129-154, 2005.
DOI : 10.1007/s11241-005-0507-9

E. Bini, G. C. Buttazzo, G. M. Buttazzo, R. I. Davis, T. Rothvoß et al., Exact Quantification of the Sub-optimality of Uniprocessor Fixed Priority Pre-emptive Scheduling Real-Time Systems to appear Control Robotics: The Procedural Control of Physical Processes Multiprogramming for hybrid computation Finding Response Times in a Real-time System Speed is as powerful as clairvoyanceOn the complexity of fixedpriority scheduling of periodic real-time tasks Fixed priority scheduling of periodic task sets with arbitrary deadlines The rate monotonic scheduling algorithm: Exact characterization and average case behaviourScheduling algorithms for multiprogramming in a hard-real-time environment, IEEE Transactions on Computers Proceedings of the IFIP congress Proceedings of AFIPS Fall Joint Computing Conference Proceedings of the 36th Symposium on Foundations of Computer Science Proceedings 11th IEEE Real-Time Systems Symposium Proceedings of the IEEE Real-Time Systems Symposium Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment, pp.933-942, 1967.

K. W. Tindell, A. Burns, and A. J. Wellings, An extendible approach for analyzing fixed priority hard real-time tasks " . Real- Time Systems, pp.133-151, 1994.

A. Zuhily and A. Burns, Optimal -monotonic priority assignment, Information Processing Letters, vol.103, issue.6, pp.247-250, 2007.
DOI : 10.1016/j.ipl.2007.04.006