algorithm - How to assign tasks -


Here's the view.
There are some tasks to run these tasks, and some machines can run each machine-specific task. But the number of tasks that can be played on each machine is limited by by their hardware (we can think that each machine has some working slots). Once you assign a task to a machine, it can not be preempted for an infinite long time, so there is no need to consider using these slots for these different tasks. For example, 1, 2, 3, 4, 5, and 2 machines A and B. The number of work and work that is running on each machine is shown:
a [1, 2, 3] (2)
b [2, 4] (1)
The number in the square bracket represents the functions that machines can run, and in the rear brackets, numbers represent the number of tasks that machines can run.

The problem now is how to assign the number of assignments to maximize these tasks? Can an algorithm solve this problem?

Thanks (-:

Please take a look at this, for example .



Comments

Popular posts from this blog

Java - Error: no suitable method found for add(int, java.lang.String) -

java - JPA TypedQuery: Parameter value element did not match expected type -

c++ - static template member variable has internal linkage but is not defined -