New for: D1, D3, D4, D5
We also propose a profit maximization variant of the feasibility problem, where every task has a non-negative profit, and the goal is to find a subset of tasks that can be scheduled feasibly with maximum profit. We give the first constant-speed, constant-approximation algorithm for the case of synchronous task systems, together with related hardness results.
(Joint work with V. Bonifaci, H.-L. Chan, A. Marchetti-S.)