Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A Finite Source Stock-dependent Stochastic Inventory System with Heterogeneous Servers and Retrial Facility

Version 1 : Received: 8 December 2023 / Approved: 8 December 2023 / Online: 11 December 2023 (04:41:58 CET)

How to cite: Thanushkodi, H.; Kathirvel, J.; Krishnasamy, S.; Vishnukumaran, A.K.; Sztrik, J. A Finite Source Stock-dependent Stochastic Inventory System with Heterogeneous Servers and Retrial Facility. Preprints 2023, 2023120604. https://doi.org/10.20944/preprints202312.0604.v1 Thanushkodi, H.; Kathirvel, J.; Krishnasamy, S.; Vishnukumaran, A.K.; Sztrik, J. A Finite Source Stock-dependent Stochastic Inventory System with Heterogeneous Servers and Retrial Facility. Preprints 2023, 2023120604. https://doi.org/10.20944/preprints202312.0604.v1

Abstract

This article deals with a finite-source stock-dependent stochastic inventory system with heterogeneous servers and retrial facility. The system can store up to S number of items, and the lifetime of each item follows an exponential distribution. The primary customers arrive in a finite waiting hall from a finite source and get service from the multi-channel (c-heterogeneous servers). The customer’s arrival rate depends on the present stock level. Those customers who arrive while the waiting hall is full enter into the finite orbit. Also, customers in the waiting hall can become impatient and enter the orbit. The (s,Q) ordering policy is adopted for the replenishment of stocks. In the steady state, the joint probability distribution of a number of items in the inventory, busy servers, customers in the waiting hall, and orbit is computed. The comparative numerical analysis of heterogeneous and homogeneous servers on the expected total cost, the average number of customers in the waiting hall and orbit, the fraction of successful retrial rate, and the average impatient customer rate are also carried out.

Keywords

Stock-dependent arrival; heterogeneous servers; (s,Q) ordering policy; orbital customers; impatient customers

Subject

Computer Science and Mathematics, Probability and Statistics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.