©
Packet filling, as tubes
  Fills (via Monte Carlo) packets, as tubes, with items. SPE Nazaré/pt
2024.May.10 21:02:40
.L, U g   (specification limits) Lower, upper specs on packet weight (Σ X). •
μ, σ g Mean and st. dev. for the weight of each item, X.
Xa, Xb g   (0 < Xa < x < Xb) Truncation Xa (min) and Xb (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 ("bag") of items, in a tube-style, FIFO (first in, first out) strategy (as in a doubly open tube). The objective is a final filling with weight (mass) in (L, U). An example might be to fill a bag of 2 kg of oranges, namely (as in the base data), weighing between L = 2000 and U = 2080 g.

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

Terminology for fractions (costs incurred): 'frTr', fr. truncated from the original product; 'frWa' (waste), fr. wasted as giveaway (weight above L); 'frRe' (rejected), fr. of unused items, possibly recyclable.

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

References: Plate: TubePacketFill3

• "Calibrafruta", Leiria (Portugal).

• 1900-04-12: Youden, William John (1971-03-31).

 
 
Valid HTML 4.01! IST http://web.ist.utl.pt/~mcasquilho/compute/qc/Fx-3tubefill.php
Created: 2011-04-12 — Last modified: 2011-10-01