Let $$T \, =\, \{T_1, T_2, \ldots, T_n\}$$ be a set of n independent tasks and $$\mathcal{P}=\{P_1, P_2,\ldots, P_m\}$$ a set of m processors. During each time instant, each processor can be used by a single task at most. A schedule is for each task an allocation of one or more time intervals to...