Analysis of an M/PH/1 Retrial Queueing-Inventory System with Level Dependent Retrial Rate

Abstract

We analyze a queueing-inventory system which can model airline and railway reservation systems. An arriving customer to an idle server joins for service immediately with exactly one item from inventory at the moment of service completion if there are some on-hand inventory, or else he accesses to a buffer of varying size (the buffer capacity varies and equals to the number of the items in the inventory with maximum size S). When the buffer overflows, the customer joins an orbit of infinite capacity with probability p or is lost forever with probability 1−p. Arrivals form a Poisson process, and service time has phase type distribution. The time between any two successive retrials of the orbiting customer is exponentially distributed with parameter depending on the number of customers in the orbit. In addition, the items have a common life time with exponentially distributed. Cancellation of orders is possible before their expiry and intercancellation times are assumed to be exponentially distributed. The stability condition and steady-state probability vector have been studied by Neuts–Rao truncation method using the theory of Level Dependent Quasi-Birth-Death (LDQBD) processes. Several stationary performance measures are also computed. Furthermore, we provide numerical illustration of the system performance with variation in values of underlying parameters and analyze an optimization problem.

An M/PH/1 Queue with Catastrophes

“…Kim [24] analyzed the waiting time distribution according to the M/P H/1 retrial queue and given numerical calculation of it. Sakuma [25] considered an M/P H/1 queue model subject to different service speeds(also see Xu [26] and Liu [27]).…”