2 citations · 3 across the 6 of their papers we have counts for
1 paper · 1 filter
Matthew Akram, Nikolai Maas, Peter Sanders +1
The NP-hard scheduling problem P||C_max encompasses a set of tasks with known execution time which must be mapped to a set of identical machines such that the overall completion ti…