Controlled Arrivals on the Retrial Queueing–Inventory System with an Essential Interruption and Emergency Vacationing Server

N. Nithya, N. Anbazhagan, S. Amutha, K. Jeganathan, Gi-Cheon Park, Gyanendra Prasad Joshi () and Woong Cho ()
Additional contact information
N. Nithya: Department of Mathematics, Alagappa University, Karaikudi 630004, India
N. Anbazhagan: Department of Mathematics, Alagappa University, Karaikudi 630004, India
S. Amutha: Ramanujan Centre for Higher Mathematics, Alagappa University, Karaikudi 630003, India
K. Jeganathan: Ramanujan Institute for Advanced Study in Mathematics, University of Madras, Chennai 600005, India
Gi-Cheon Park: Department of International Affairs and Education, Gangseo University, Seoul 07661, Republic of Korea
Gyanendra Prasad Joshi: Department of Computer Science and Engineering, Sejong University, Seoul 05006, Republic of Korea
Woong Cho: Department of Electronics, Information and Communication Engineering, Kangwon National University, Samcheok-si 25913, Gangwon State, Republic of Korea

Mathematics, 2023, vol. 11, issue 16, 1-24

Abstract: In recent times, we have encountered new situations that have imposed restrictions on our ability to visit public places. These changes have affected various aspects of our lives, including limited access to supermarkets, vegetable shops, and other essential establishments. As a response to these circumstances, we have developed a continuous review retrial queueing–inventory system featuring a single server and controlled customer arrivals. In our system, customers arriving to procure a single item follow a Markovian Arrival Process, while the service time for each customer is modeled by an exponential distribution. Inventories are replenished according to the ( s , Q ) reordering policy with exponentially distributed lead times. The system controls arrival in the waiting space with setup time. The customers who arrive at a not allowed situation decide to enter an orbit of infinite size with predefined probability. Orbiting customers make retrials to claim a place in the waiting space, and their inter-retrial times are exponentially distributed. The server may experience essential interruption (emergency situation) which arrives according to Poisson process. Then, the server goes for an emergency vacation of a random time which is exponentially distributed. In the steady-state case, the joint probability of the number of customers in orbit and the inventory level has been found, and the Matrix Geometric Method has been used to find the steady-state probability vector. In numerical calculations, the convexity of the system and the impact of F-policy and emergency vacation in the system are discussed.

Keywords: F-policy; emergency vacation; essential interruption; retrial customers; Markovian Arrival Process (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/16/3560/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/16/3560/ (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:11:y:2023:i:16:p:3560-:d:1219389

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 ().