©
Packet filling, as tubes
  Fills (via Monte Carlo) packets, as tubes, with items. EXPERIMENTAL
2024.Nov.25 05:32:26
.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   (0 < a < x < b) Truncation a (min) and b (max) for item. •
Strategy   Strategy: none or FIFO rectify. •
N, .seed No. of items ("lot size"), random no. gener. seed. •
tol, klass, ymax   g−1 ['0' (¬ '.0'), auto.] Tolerance, no. of histo. classes, max. y for graph. •
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, namely (as in the base data), weighing between L = 1000 and U = 1040 g.

The weight of each item is considered truncated Gaussian. (Tolerance is for the inversion of the Gaussian distribution.)

Several other, better strategies (worthy of research) would be convenient to try to reach the final sum within the limits.

References: Plate: TubePacketFill2

• "Calibrafruta", Leiria (Portugal).

• 1752-09-18: Legendre, Adrien-Marie (1833-01-10).

 
 
Valid HTML 4.01! IST http://web.ist.utl.pt/~mcasquilho/compute/qc/Fx-Xtubefill.php
Created: 2010-09-18 — Last modified: 2011-09-25