| 摘要 |
A plurality of weighing data are combined to find a total weight combination closest to a preset value within an allowable preset range. Articles are discharged from those weighing machines which give such a total weight combination. For such a combinatorial computation, the empty weighing machines are first detected from among the weighing machines for which the combinatorial computation has been carried out, and then articles are supplied to the empty weighing machines. Weighing data from a number of weighing machines, selected from a plurality of weighing machines, are combined to allow selection of a weight combination equal or closest to the preset value. If a total weight combination given by the selected weighing machines falls within the allowable preset range, then articles are discharged from those weighing machines which give such a total weight combination during a first cycle. In a second cycle of combinatorial computation, a predetermined number or fewer weighing machines are selected from the weighing machines other than those selected for discharging articles in the first cycle, and combinatorial computation is effected on the selected weighing machines. First, it is determined whether there can be found a weight combination in the allowable preset range, and, if not, a new combination of weighing machines is selected from all weighing machines for a third combinatorial computation cycle.
|
