I am trying to find this problem, but I do not know what it is called. The premise is this:
Given m machines and j tasks, where each task can only be assigned to machines I through j, I need to assign tasks to the machines so that I can maximize the occupied machines at a time. My only concern is how they are assigned at time 0. I don’t care about how to plan the remaining tasks after completion.
As soon as a task and a machine are assigned to each other, no other task or machine can affect any of the participants.
samoz source
share