Heuristic Computation of Periodic-Review Base Stock Inventory Policies
We study the problem of determining production quantities in each period of an infinite horizon for a single item produced in a capacity-limited facility. The demand for the product is random, and it is independent and identically distributed from period to period. The demand is observed at the beginning of a time period, but it need not be filled until the end of the period. Unfilled demand is backordered. A base stock or order-up-to policy is used. The shortfall is the order-up-to level minus the inventory position. The inventory system is easily understood and managed if we know the distribution of the shortfall. We develop a new approximation for this distribution, and perform extensive computational tests of existing approximations. Our new approximation works extremely well as long as the coefficient of variation of the demand is less than two. For practical applications this is by far the most interesting case. No known approximations work well consistently when the coefficient of variation of the demand is greater than two.
Volume (Year): 46 (2000)
Issue (Month): 1 (January)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Paul Glasserman & Sridhar Tayur, 1995. "Sensitivity Analysis for Base-Stock Levels in Multiechelon Production-Inventory Systems," Management Science, INFORMS, vol. 41(2), pages 263-281, February.
- Tayur, S.R., 1992. "Computing the Optimal Policy for Capacitated Inventory Models," GSIA Working Papers 1992-07, Carnegie Mellon University, Tepper School of Business.
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:46:y:2000:i:1:p:104-109. 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.