Concept: Scheduling Schema
There are many ways to schedule concurrency units. Three primary categories are fairness doctrines, priority-based, and arrival-based schema.
Relationships
Main Description

Task scheduling can be classified in different ways, such as in the figure below.

Figure 1. A taxonomy of Scheduling Schemas

Class diagram showing a taxonomy of scheduling schemas

For real-time systems, Rate Monotonic Scheduling (RMS) is both optimal (other scheduling patterns can't do better) and stable (you can predict which tasks will fail in an overload situation). Earliest Deadline First (EDF) dynamically adjusts the priority depending on the nearness of the deadlines. EDF is optimal but not stable.