Periodic Versus "Can-Order" Policies for Coordinated Multi-Item Inventory Systems
The coordinated multi-item inventory problem refers to the problem of managing inventories where there is a joint fixed cost for replenishing plus an item-by-item fixed cost for each item included in the replenishment order. Given that the optimal solution is likely to be too complex, attention has focused on fixed heuristics, and in particular `can-order' or (s, c, S) policies. This paper makes two contributions. First, a new lower bound on the cost of the optimal policy is proposed in order that the performance of heuristics may be measured. Second, motivated by the lower bound, a simple periodic policy is proposed and shown to be an improvement over `can-order' policies for many data sets.
Volume (Year): 34 (1988)
Issue (Month): 6 (June)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:34:y:1988:i:6:p:791-796. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.