Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

This publication has 10 references indexed in Scilit:

• Preemptively scheduling hard-real-time sporadic tasks on one processor
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1990
• A new algorithm for scheduling periodic, real-time tasks
  Algorithmica, 1989
• Integer Programming with a Fixed Number of Variables
  Mathematics of Operations Research, 1983
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
  Performance Evaluation, 1982
• Scheduling periodically occurring tasks on multiple processors
  Information Processing Letters, 1981
• A note on preemptive scheduling of periodic, real-time tasks
  Information Processing Letters, 1980
• Some simple scheduling algorithms
  Naval Research Logistics Quarterly, 1974
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
  Journal of the ACM, 1973
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971