PEARLS
Decision versions of scheduling problems belong to NP and most of
them are NP-hard. Researchers have concentrated their
efforts to find efficient heuristics that can solve the scheduling
problem in all circumstances: preemptable or non-preemptable,
with or without precedence constraints, uniprocessor or multiprocessor,
and so on. Some of the traditional methods are Rate-Monotonic (RM),
Earliest-Deadline-First (EDF), and Least-Laxity (LL).
Our paper integrates all these heuristics in only one single tool
able to do analysis and simulation of an arbitrary set of tasks.