1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Sören Henning, Klaus Jansen, Malin Rau +1
We study the Parallel Task Scheduling problem Pm∣sizej∣Cmax with a constant number of machines. This problem is known to be strongly NP-complete for each m≥5, while i…