I am trying to solve a preemptive multi-core scheduling problem, where the input is the tasks. The number of cores
M can be decided after seeing the input tasks. I need to output the minimal
M such that the run time is as long as the maximal task length.
I feel this is related to bin packing with fragmentation, but fragmentation does not require linear constraints.
I doubt I am the first to study this problem but have been unable to find a name for this problem. Does it have a name?