Rate-monotonic scheduling is a fixed priority real time scheduling algorithm. Extensive work has been done to algorithmically determine the schedulability of the tasks in a real time task set. A tool to perform such schedulability analysis is provided below. As tasks are added to the set, the necessary tests are performed and the proofs are given in a typeset format. Each task has a task number (T), worst case execution time (C), execution period (P), maximum time spent blocked by lower priority tasks (B), and deadline (D). In addition to the individual task parameters, there is a task set parameter for the context switch time (S). This tool is meant to help students understand the schedulability of real time task sets. In addition, it can help instructors when producing problems and solutions. The typeset output can be viewed as plain text LaTeX commands that are formatted fairly cleanly.