<p>I am still unclear about the precise objective you want to optimise over, but you could look at</p>

<ul>
<li>Peter Brucker,
Andreas Drexl,
Rolf Möhring,
Klaus Neumann, and
Erwin Pesch,
<em>Resource-constrained project scheduling: Notation, classification, models, and methods</em>,
European Journal of Operational Research
<strong>112</strong>
3–41,
1999.
doi:<a href="http://dx.doi.org/10.1016/S0377-2217%2898%2900204-5" rel="nofollow">10.1016/S0377-2217(98)00204-5</a></li>
</ul>

<p>for a comprehensive interdisciplinary overview of related terminology for many such problems.  These kinds of problems are studied in operational research, management science, computer science, and statistics.  There is an extensive literature about nearly every kind of such problem, but it can be hard to find the right terms and to translate between the different styles of exposition.  Good luck!</p>

CC BY-SA 3.0
2013-06-24T15:39:00.337Z
2013-06-24T15:39:00.337Z
András Salamon
<p>Let's say I have a machine with many boxes of different sizes. I want to put packages inside those boxes. Packages arrive at different time and then stay in the box for specific period of time. I need to be able to tell if there is be an appropriate box available in the future for the package (will there be small size box for package in five days?).</p>

<p>I'm sure there are many papers about this kind of problem. Unfortunately I cannot find one, wrong keywords probably.</p>

<p>Thank you for your answers.</p>

CC BY-SA 3.0
2013-06-13T21:31:53.113Z
The setup is not clear.  "Boxes arrive ... and then stay in the box"?
András Salamon
CC BY-SA 3.0
2013-06-14T08:49:18.117Z
Sorry, packages arrive.
Jakub Kulhan
CC BY-SA 3.0
2013-06-14T14:40:17.107Z
I think the question needs more clarification.
Kaveh
<ds.algorithms><pr.probability><application-of-theory><online-algorithms>
Capacity planning algorithm resources
Jakub Kulhan
# Capacity planning algorithm resources

(Asked by: username_0 on 2013-06-12)

Let's say I have a machine with many boxes of different sizes. I want to put packages inside those boxes. Packages arrive at different time and then stay in the box for specific period of time. I need to be able to tell if there is be an appropriate box available in the future for the package (will there be small size box for package in five days?).

I'm sure there are many papers about this kind of problem. Unfortunately I cannot find one, wrong keywords probably.

Thank you for your answers.

**Tags:** ds.algorithms, pr.probability, application-of-theory, online-algorithms
> **Comments:**
> **username_1**: The setup is not clear.  "Boxes arrive ... and then stay in the box"?  
> **username_0**: Sorry, packages arrive.  
> **username_2**: I think the question needs more clarification.  

---

## 1 answers

### Answer by username_1 on 2013-06-24. Score: 1

I am still unclear about the precise objective you want to optimise over, but you could look at

* Peter Brucker,
  Andreas Drexl,
  Rolf Möhring,
  Klaus Neumann, and
  Erwin Pesch,
  *Resource-constrained project scheduling: Notation, classification, models, and methods*,
  European Journal of Operational Research
  **112**
  3–41,
  1999.
  doi:[10.1016/S0377-2217(98)00204-5](http://dx.doi.org/10.1016/S0377-2217%2898%2900204-5)

for a comprehensive interdisciplinary overview of related terminology for many such problems. These kinds of problems are studied in operational research, management science, computer science, and statistics. There is an extensive literature about nearly every kind of such problem, but it can be hard to find the right terms and to translate between the different styles of exposition. Good luck!


---

