An aesy way will be to get/build a "decahedron" and mark one face. Trow
it and audit the case if the mark comes up. Other choice is an
"icoshedron" (is regular) and mark two faces.
A more technical (not necesarily better) is to use a random number
generator and audit when the number comes up less or equal than 1/10nth
of the max.
Bill Reger wrote:
We would like to audit 10% of the Cases that flow down the shipping
conveyor - checking that the contents of the Case matched what was
(supposedly) packed.
Now obviously we could count each Case and pull every 10th Case for audit.
But it would not take long for someone to figure this out - and if they
were so inclined - only short Cases other than the 10th in line.
Is there an algorithm/logic that we could employ to randomly pull Cases
that would equate to 10% over the course of a day but not be every 10th
Case? (My logic brain is on strike today and I can't think of a way to
design this.)
Bill
