A Matching Approach for Replenishing Rectangular Stock Sizes
研究了矩形材料库存的补充问题，通过非二分加权匹配模型确定库存尺寸需求，并提出一种高效求解实际应用（最多3000节点）的混合方法。
AbstractConsider a replenishment problem in which several different rectangular sizes of material are stocked. Customers order rectangles of the material, but the rectangles ordered have a range on specified width as well as on specified length. To satisfy the customer requirements, the stock material can be cut once longitudinally in order to satisfy two customer requirements or not cut at all, that is, an entire stock piece of material is used to satisfy one customer requirement. If an exact match is impossible in the current planning period, the unused material must be returned to stock— an expensive and undesirable situation. In this paper, a nonbipartite weighted matching problem formulation will be given for determining the replenishment requirements of rectangular stock sizes. Then, a hybrid solution approach, capable of solving real applications (typically up to 3000 nodes) efficiently, will be discussed. This solution was implemented in September 1998 and has operated successfully since then.Keywords: graph matchingpractice of ORcutting stockheuristics