A matching approach for replenishing rectangular stock sizes

A matching approach for replenishing rectangular stock sizes

0.00 Avg rating0 Votes
Article ID: iaor20011352
Country: United Kingdom
Volume: 51
Issue: 3
Start Page Number: 253
End Page Number: 257
Publication Date: Mar 2000
Journal: Journal of the Operational Research Society
Authors: , , , ,
Keywords: graphs
Abstract:

Consider 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.

Reviews

Required fields are marked *. Your email address will not be published.