A modelling and simulation approach to assessment of a negative binomial approximation in a multi-echelon inventory system
by Adriano O. Solis; Francesco Longo; Letizia Nicoletti; Pietro Caruso; Elisa Fazzari
International Journal of Simulation and Process Modelling (IJSPM), Vol. 9, No. 3, 2014

Abstract: Some studies in the multi-echelon inventory systems literature have used a negative binomial distribution to approximate a critical random variable arising in the model. Graves (1996) developed a multi-echelon inventory model with fixed replenishment intervals, where each site follows a base stock policy. He proposed in the one-warehouse, N-retailer case a negative binomial distribution to approximate a random variable he referred to as 'uncovered demand'. Computational evidence was provided to demonstrate the effectiveness of the approximation. Graves then suggested search procedures for approximately optimal base stock levels at the warehouse and N identical retailers under two customer service criteria: 1) probability of no stockout; 2) fill rate. A separate analytical evaluation of the negative binomial approximation has been preliminarily reported elsewhere. In the current study, we apply a modelling and simulation approach to assess whether the approximation-based search procedures, in fact, lead to optimal or near-optimal stock levels.

Online publication date: Thu, 16-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Simulation and Process Modelling (IJSPM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com