Exact and asymptotic analysis of infinite server batch service queues with random batch sizes

Ayane Nakamura () and Tuan Phung-Duc ()
Additional contact information
Ayane Nakamura: University of Tsukuba
Tuan Phung-Duc: University of Tsukuba

Queueing Systems: Theory and Applications, 2024, vol. 106, issue 1, No 3, 129-158

Abstract: Abstract Batch service queueing systems are basically classified into two types: a time-based system in which the service facilities depart according to inter-departure times that follows a given distribution, such as the conventional bus system, and a demand-responsive system in which the vehicles start traveling provided that a certain number of customers gather at the waiting space, such as ride-sharing and on-demand bus. Motivated by the recent spreading of demand-responsive transportation, this study examines the M/M $$^{\textit{X}}$$ X / $$\infty $$ ∞ queue. In this model, whenever the number of waiting customers reaches a capacity set by a discrete random variable $$\textit{X}$$ X , customers are served by a group. We formulate the M/M $$^{\textit{X}}$$ X / $$\infty $$ ∞ queue as a three-dimensional Markov chain whose dimensions are all unbounded and depict a book-type transition diagram. The joint stationary distribution for the number of busy servers, number of waiting customers, and batch size is derived by applying the method of factorial moment generating function. The central limit theorem is proved for the case that $$\textit{X}$$ X has finite support under heavy traffic using the exact expressions of the first two moments of the number of busy servers. Moreover, we show that the M/M $$^\textit{X}$$ X / $$\infty $$ ∞ queue encompasses the time-based infinite server batch service queue (M/M $$^{G(x)}$$ G ( x ) / $$\infty $$ ∞ queue), which corresponds to the conventional bus system, under a specific heavy traffic regime. In this model, the transportation facility departs periodically according to a given distribution, $$\textit{G(x)}$$ G ( x ) , and collects all the waiting customers for a batch service for an exponentially distributed time corresponding to the traveling time on the road. We show a random variable version of Little’s law for the number of waiting customers for the M/M $$^{G(x)}$$ G ( x ) / $$\infty $$ ∞ queue. Furthermore, we present a moment approach to obtain the distribution and moments of the number of busy servers in a GI/M/ $$\infty $$ ∞ queue by utilizing the M/M $$^{G(x)}$$ G ( x ) / $$\infty $$ ∞ queue. Finally, we provide some numerical results and discuss their possible applications on transportation systems.

Keywords: Batch service; Random batch sizes; Infinite server queue; Factorial moment; Central limit theorem; Moment approach; Random variable version of Little’s law; M/M $$^\textit{X}$$ X / $$\infty $$ ∞ queue; GI/M/ $$\infty $$ ∞ queue; M/M $$^{G(x)}$$ G ( x ) / $$\infty $$ ∞ queue; Ride-sharing; Bus systems; Transportation; 60K20; 60K25; 60K30 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-023-09898-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:queues:v:106:y:2024:i:1:d:10.1007_s11134-023-09898-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-023-09898-4

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().