On the optimal control of loss probability and profit in a GI/C-BMSP/1/N queueing system

Abstract

This paper deals with a single server queueing system where the waiting space is limited. The server serves the customer in batches. The arrival process is considered to be renewal type and the services are considered to be correlated which has been presented by a continuous-time batch Markovian service process (C-BMSP). Distribution of the system length at pre-arrival instant of a customer and at an arbitrary-epoch have been determined for this queueing system. These probability distributions have been used for obtaining the blocking probability of an arbitrary customer, expected system-length, expected waiting time of an arbitrary customer in the system, and several other important performance measures. This model may find application in queueing systems involving inventory where delay in demand may lead to perishing of goods due to long wait in the system. Also, a profit function has been derived for such a queueing model to maximize the profit from the system for certain model parameters. Finally, assuming that the inter-arrival time follows phase-type distribution, a few numerical examples have been presented in the form of graphs and tables. � 2019, Operational Research Society of India.