Rate-Monotonic Scheduling (RMS) is a static-priority scheduling algorithm for periodic tasks in a real-time system. It assigns priorities based on task frequency: the shorter a task’s period (the higher its rate), the higher its priority. RMS is an optimal static-priority algorithm, meaning if any static-priority algorithm can schedule a task set, RMS can too. Schedulability can be checked using a utilization-based test. Traveling salesman problem applications also include sequencing jobs, a combinatorial task related to real-time scheduling. Scheduling theory, like the linear programming developed by Dantzig, aims for the best use of limited resources.

















