Optimal setup of a multihead weighing machine
From MaRDI portal
Publication:1751822
Abstract: Multihead weighing machines (MWMs) are ubiquitous in industry for fast and accurate packaging of a wide variety of foods and vegetables, small hardware items and office supplies. A MWM consists of a system of multiple hoppers that are filled with product which when discharged through a funnel fills a package to a desired weight. Operating this machine requires first to specify the product weight targets or setpoints that each hopper should contain on average in each cycle, which do not need to be identical. The selection of these setpoints has a major impact on the performance of a MWM. Each cycle, the machine fills a package running a built-in knapsack algorithm that opens --or leaves shut-- different combinations of hoppers releasing their content such that the total weight of each package is near to its target, minimizing the amount of product ``given away". In this paper, we address the practical open problem for industry of how to determine the setpoint weights for each of the hoppers given a desired total package weight for a widely used type of MWM. An order statistic formulation based on a characterization of near-optimal solutions is presented. This is shown to be computationally intractable, and a faster heuristic that utilizes a lower bound approximation of the expected smallest order statistic is proposed instead. The setup solutions obtained with the proposed methods can result in substantial savings for MWM users. Alternatively, the analysis presented could be used by management to justify the acquisition of new MWM machines.
Recommendations
- Optimization of multiweighing packing proceedings
- BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Variability reduction with multiweighting proceedings
- Minimizing the number of pickups on a multi-head placement machine
- A class of generalized greedy algorithms for the multi-knapsack problem
Cites work
- Algorithm AS 249: Evaluation of the Mean and Covariance of the Truncated Multinormal Distribution
- Asymptotic behavior of the quadratic knapsack problem
- Average-case performance of rollout algorithms for knapsack problems
- BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- scientific article; zbMATH DE number 3223285 (Why is no real title available?)
- scientific article; zbMATH DE number 3378377 (Why is no real title available?)
- Joint optimal determination of process mean, production quantity, pricing, and market segmentation with demand leakage
- Optimal means for continuous processes in series
- Reducing performance variation in the canning problem
- Reverse programming the optimal process mean problem to identify a factor space profile
- Robust efficiency measures for linear knapsack problem variants
- Techniques for solving subset sum problems within a given tolerance
- The average behaviour of greedy algorithms for the knapsack problem: general distributions
- The canning problem revisited: the case of capacitated production and fixed demand
- TIGHT BOUNDS ON EXPECTED ORDER STATISTICS
Cited in
(3)
This page was built for publication: Optimal setup of a multihead weighing machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751822)
