In this paper, we consider the problem of scheduling tasks on two dedicated processors where some tasks need to be processed only by the first processor and some others by the second processor; the remaining tasks, however, need both processors simultaneously. Tasks have release dates and have...

Let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$T \, =\, \{T_1, T_2, \ldots, T_n\}$$</EquationSource> </InlineEquation> be a set of n independent tasks and <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$\mathcal{P}=\{P_1, P_2,\ldots, P_m\}$$</EquationSource> </InlineEquation> 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...</equationsource></inlineequation></equationsource></inlineequation>

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...