<p>I'm trying to find papers that discuss approaches (in particular, any Deep Learning or Deep Reinforcement Learning techniques) that could be used used to solve the problem described in the next paragraph. My question is whether such problem has a an <strong>equivalent problem with a &quot;famous&quot; name</strong> (similarly to what happens with problems like the <a href="https://en.wikipedia.org/wiki/Knapsack_problem" rel="nofollow noreferrer">Knapsack problem</a> or the <a href="https://en.wikipedia.org/wiki/Job_shop_scheduling" rel="nofollow noreferrer">Job Shop Scheduling problem</a>), since that would make my search much easier.</p>
<p>The problem in question is: given <em>n</em> tasks <em>T1, T2, ..., Tn</em> of varying cost <span class="math-container">$c_{i}$</span>, and <em>m</em> nodes <em>N1, ..., Nm</em> with varying capacity <span class="math-container">$r_{i}$</span>, what is the task allocation that minimizes the number of used nodes as priority 1, and the total quantity of free resources in the used nodes as priority 2.</p>
<p>So for example, if I have tasks <em>{T1, T2}</em> with costs <em>{3, 7}</em>, and nodes <em>{N1, N2, N3}</em> with capacity <em>{5, 11, 12}</em>. The optimal alocation would be assigning <em>T1</em> and <em>T2</em> to <em>N2</em>, since it would require only one node, and the number of free resources is <span class="math-container">$11 - 7 - 3 = 1$</span>.</p>
<p>Any tips on what sort of terminology I could use on my search are also welcome! Same applies to suggestions on similar &quot;famous&quot; problems that, even if not equivalent, could be interesting to look at (as per my comments above, I am already familiar with the Knapsack and the JSS problems).</p>
<p>Thank you very much!</p>

CC BY-SA 4.0
2021-04-07T05:50:50.657Z
If there is only one priority (number of used nodes), then it is bin packing.
Chao Xu
CC BY-SA 4.0
2021-04-07T09:35:54.680Z
A good search term should be "variable sized bin packing".
Gamow
<np-hardness><optimization><combinatorics><reinforcement-learning>
Is there a "common" name for this type of combinatorial optimization problem?
RR_28023
# Is there a "common" name for this type of combinatorial optimization problem?

(Asked by: username_0 on 2021-04-07)

I'm trying to find papers that discuss approaches (in particular, any Deep Learning or Deep Reinforcement Learning techniques) that could be used used to solve the problem described in the next paragraph. My question is whether such problem has a an **equivalent problem with a "famous" name** (similarly to what happens with problems like the [Knapsack problem](https://en.wikipedia.org/wiki/Knapsack_problem) or the [Job Shop Scheduling problem](https://en.wikipedia.org/wiki/Job_shop_scheduling)), since that would make my search much easier.

The problem in question is: given *n* tasks *T1, T2, ..., Tn* of varying cost $c\_{i}$, and *m* nodes *N1, ..., Nm* with varying capacity $r\_{i}$, what is the task allocation that minimizes the number of used nodes as priority 1, and the total quantity of free resources in the used nodes as priority 2.

So for example, if I have tasks *{T1, T2}* with costs *{3, 7}*, and nodes *{N1, N2, N3}* with capacity *{5, 11, 12}*. The optimal alocation would be assigning *T1* and *T2* to *N2*, since it would require only one node, and the number of free resources is $11 - 7 - 3 = 1$.

Any tips on what sort of terminology I could use on my search are also welcome! Same applies to suggestions on similar "famous" problems that, even if not equivalent, could be interesting to look at (as per my comments above, I am already familiar with the Knapsack and the JSS problems).

Thank you very much!

**Tags:** np-hardness, optimization, combinatorics, reinforcement-learning

> **Comments:**
> **username_1**: If there is only one priority (number of used nodes), then it is bin packing.  
> **username_2**: A good search term should be "variable sized bin packing".  

---

## 0 answers

