IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v106y2024i1d10.1007_s11134-023-09898-4.html
   My bibliography  Save this article

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

Author

Listed:
  • Ayane Nakamura

    (University of Tsukuba)

  • Tuan Phung-Duc

    (University of Tsukuba)

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.

Suggested Citation

  • Ayane Nakamura & Tuan Phung-Duc, 2024. "Exact and asymptotic analysis of infinite server batch service queues with random batch sizes," Queueing Systems: Theory and Applications, Springer, vol. 106(1), pages 129-158, February.
    • Handle: RePEc:spr:queues:v:106:y:2024:i:1:d:10.1007_s11134-023-09898-4
    DOI: 10.1007/s11134-023-09898-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-023-09898-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-023-09898-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. P. M. Ghare, 1968. "Letter to the Editor—Multichannel Queuing System with Bulk Service," Operations Research, INFORMS, vol. 16(1), pages 189-192, February.
    2. Sim, S. H. & Templeton, J. G. C., 1983. "Computational procedures for steady-state characteristics of unscheduled multi-carrier shuttle systems," European Journal of Operational Research, Elsevier, vol. 12(2), pages 190-202, February.
    3. Herwig Bruneel & Sabine Wittevrongel & Dieter Claeys & Joris Walraevens, 2016. "Discrete-time queues with variable service capacity: a basic model and its analysis," Annals of Operations Research, Springer, vol. 239(2), pages 359-380, April.
    4. K. L. Arora, 1964. "Two-Server Bulk-Service Queuing Process," Operations Research, INFORMS, vol. 12(2), pages 286-294, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Jan-Kees Ommeren & Niek Baer & Nishant Mishra & Debjit Roy, 2020. "Batch service systems with heterogeneous servers," Queueing Systems: Theory and Applications, Springer, vol. 95(3), pages 251-269, August.
    3. Ayane Nakamura & Tuan Phung-Duc, 2023. "Equilibrium Analysis for Batch Service Queueing Systems with Strategic Choice of Batch Size," Mathematics, MDPI, vol. 11(18), pages 1-22, September.
    4. Michiel De Muynck & Herwig Bruneel & Sabine Wittevrongel, 2023. "Analysis of a Queue with General Service Demands and Multiple Servers with Variable Service Capacities," Mathematics, MDPI, vol. 11(4), pages 1-21, February.
    5. Nitin Kumar & U. C. Gupta, 2020. "Analysis of batch Bernoulli process subject to discrete-time renewal generated binomial catastrophes," Annals of Operations Research, Springer, vol. 287(1), pages 257-283, April.
    6. Michiel Muynck & Herwig Bruneel & Sabine Wittevrongel, 2020. "Analysis of a queue with general service demands and correlated service capacities," Annals of Operations Research, Springer, vol. 293(1), pages 73-99, October.
    7. Nitin Kumar & U. C. Gupta, 2020. "A Renewal Generated Geometric Catastrophe Model with Discrete-Time Markovian Arrival Process," Methodology and Computing in Applied Probability, Springer, vol. 22(3), pages 1293-1324, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:106:y:2024:i:1:d:10.1007_s11134-023-09898-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.