Sojourn Time Analysis of a Single-Server Queue with Single- and Batch-Service Customers.

There are various types of sharing economy services, such as ride-sharing and shared-taxi rides. Motivated by these services, we consider a single-server queue in which customers probabilistically select the type of service, that is, the single service or batch service, or other services (e.g., train). In the proposed model, which is denoted by the M+M(K)/M/1 queue, we assume that the arrival process of all the customers follows a Poisson distribution, the batch size is constant, and the common service time (for the single- and batch-service customers) follows an exponential distribution. In this model, the derivation of the sojourn time distribution is challenging because the sojourn time of a batch-service customer is not determined upon arrival but depends on single customers who arrive later. This results in a two-dimensional recursion, which is not generally solvable, but we made it possible by utilizing a special structure of our model. We present an analysis using a quasi-birth-and-death process, deriving the exact and approximated sojourn time distributions (for the single-service customers, batch-service customers, and all the customers). Through numerical experiments, we demonstrate that the approximated sojourn time distribution is sufficiently accurate compared to the exact sojourn time distributions. We also present a reasonable approximation for the distribution of the total number of customers in the system, which would be challenging with a direct-conventional method. Furthermore, we presented an accurate approximation method for a more general model where the service time of single-service customers and that of batch-service customers follow two distinct distributions, based on our original model. [ABSTRACT FROM AUTHOR]