Title: (s, S) stochastic inventory system in Jackson network

Authors: Md. Amirul Islam; Mohammad Ekramol Islam; Abdur Rashid

Addresses: Department of Mathematics, Uttara University, Dhaka, Bangladesh; Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh ' Department of Mechanical Engineering, Sonargaon University, Dhaka, Bangladesh ' Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh

Abstract: In this work, we develop and analyse an (s, S) stochastic perishable inventory system at each node into Jackson network with a service facility in which the waiting hall of first queue has infinite capacity and second queue has finite capacity for the customers. Service times are exponentially distributed. We assume that demands arrive in the system according to a Poisson process with rate λi(> 0, ∀i) and demands only single unit item at a time. The maximum storage capacity of the ith warehouse is fixed as Si; i = 1, 2. Whenever the inventory level reaches the reorder level si(0 ≤ si < Si), an order Qi(= Sisi) units is placed to bring the level to Si. The lead-time is exponentially distributed. The items of inventory have exponential life times. The joint probability distribution of the number of customers in the system and the inventory level is obtained in the steady state case. Matrix analytical method is applied to solve for the steady state occupancy probabilities. Various system performance measures in the steady state are derived. A suitable cost function is defined and the long-run total expected cost rate is calculated. Sensitivity analysis has been carried out to study the effect of variation of parameters. Numerical examples and graphical illustrations are provided to illustrate the proposed model.

Keywords: Jackson network; (s, S)-policy; stability condition; performance analysis; sensitivity analysis.

DOI: 10.1504/IJOR.2022.122813

International Journal of Operational Research, 2022 Vol.43 No.4, pp.416 - 436

Accepted: 28 Jun 2019
Published online: 13 May 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article