|
Tube-style packet
filling
Fills (via Monte Carlo) packets (or bags) of items, in a tube-style
(FIFO) strategy. |
|
|
| .L, U |
g (specification limits) |
Lower, upper specs on packet
weight. • |
| μ, σ |
g |
Mean and st. dev. for the weight of each item. |
| a, b |
g (a < x < b)
|
Truncation a (min) and b (max) for item. • |
| N, .seed, klass |
(M, million) |
No. of trials, seed, no. of classes. |
| ymax |
g−1 |
Maximum y for graph (automatic if "0", not ".0"). • |
| Show values |
|
Shows the coordinates of the graph. • |
Simulates, via Monte Carlo, the filling of a packet (or bag) of items,
in a tube-style, FIFO (first in, first out) strategy
(as in a doubly open tube). The objective is to get a final filling
with weight (mass) in (L, U). An example might be to fill
a bag of 1 kg of oranges. The weight of each item is considered Gaussian.
Several other, better strategies would be convenient to try to reach
the final sum within the limits.
Other suggested data: small increases (or decreases)
in σ. |
| References: |
Plate: TubePacketFilling |
|
• Con-Weigh Systems,
Packing & Bag Handling.
• 1907-04-11: ScheffĂ©, Henry
(1977-07-05). |
