makespan. For this problem, which is known to be NP-hard in the strong sense, we propose a lower bound based on processor … relaxation and show that it is equal to the optimal solution for a preemptive case. We propose two heuristics with a worst …