Analysis of Stochastic State-Dependent Arrivals in a Queueing-Inventory System with Multiple Server Vacation and Retrial Facility

M. Nithya, Gyanendra Prasad Joshi (), C. Sugapriya, S. Selvakumar, N. Anbazhagan, Eunmok Yang and Ill Chul Doo ()
Additional contact information
M. Nithya: Department of Mathematics, Queuen Mary’s College, Chennai 600004, India
Gyanendra Prasad Joshi: Department of Computer Science and Engineering, Sejong University, Seoul 05006, Korea
C. Sugapriya: Department of Mathematics, Queuen Mary’s College, Chennai 600004, India
S. Selvakumar: Ramanujan Institute for Advanced Study in Mathematics, University of Madras, Chepauk, Chennai 600005, India
N. Anbazhagan: Department of Mathematics, Alagappa University, Karaikudi 630003, India
Eunmok Yang: Department of Information Security, Cryptology, and Mathematics, Kookmin University, Seoul 02707, Korea
Ill Chul Doo: Artificial Intelligence Education, Hankuk University of Foreign Studies, Dongdaemun-gu, Seoul 02450, Korea

Mathematics, 2022, vol. 10, issue 17, 1-29

Abstract: This article analyses a four-dimensional stochastic queueing-inventory system with multiple server vacations and a state-dependent arrival process. The server can start multiple vacations at a random time only when there is no customer in the waiting hall and the inventory level is zero. The arrival flow of customers in the system is state-dependent. Whenever the arriving customer finds that the waiting hall is full, they enter into the infinite orbit and they retry to enter the waiting hall. If there is at least one space in the waiting hall, the orbital customer enters the waiting hall. When the server is on vacation, the primary (retrial) customer enters the system with a rate of λ 1 ( θ 1 ) . If the server is not on vacation, the primary (retrial) arrival occurs with a rate of λ 2 ( θ 2 ) . Each arrival rate follows an independent Poisson distribution. The service is provided to customers one by one in a positive time with the rate of μ , which follows exponential distribution. When the inventory level drops to a fixed s , reorder of Q items is triggered immediately under ( s , Q ) ordering policy. The stability of the system has been analysed, and using the Neuts matrix geometric approach, the stationary probability vectors have been obtained. Moreover, various system performance measures are derived. The expected total cost analysis explores and verifies the characteristics of the assumed parameters of this model. The average waiting time of a customer in the waiting hall and orbit are investigated using all the parameters. The monotonicity of the parameters is verified with its characteristics by the numerical simulation. The discussion about the fraction time server being on vacation suggests that as the server’s vacation duration reduces, its fraction time also reduces. The mean number of customers in the waiting hall and orbit is reduced whenever the average service time per customer and average replenishment time are reduced.

Keywords: state-dependent arrival; multiple vacation; ( s , Q ) ordering policy; infinite orbit (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/17/3041/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/17/3041/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:17:p:3041-:d:895459

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().