IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v24y2022i4d10.1007_s11009-022-09963-0.html
   My bibliography  Save this article

Sojourn-time Distribution for $$M/G^a/1$$ M / G a / 1 Queue with Batch Service of Fixed Size - Revisited

Author

Listed:
  • Veena Goswami

    (Kalinga Institute of Industrial Technology)

  • Mohan Chaudhry

    (Royal Military College of Canada)

  • Abhijit Datta Banik

    (Indian Institute of Technology)

Abstract

This paper presents an explicit and straightforward method for finding the sojourn-time distribution of a random customer in an $$M/G^a/1$$ M / G a / 1 queue with a fixed-size batch service. The exhibited process is much more straightforward than the approach discussed by Yu and Tang (Methodology and Computing in Applied Probability 20(4):1503–1514, 2018). We obtain two closed-form expressions for probability density functions by using the inside and outside roots of the underlying characteristic equation. Applying partial fractions and residue theorem, we determine an explicit form of sojourn-time distribution and evaluate the distribution function for any specific time. In illustrative examples, we compare the results obtained by both methods and find that the results match excellently.

Suggested Citation

  • Veena Goswami & Mohan Chaudhry & Abhijit Datta Banik, 2022. "Sojourn-time Distribution for $$M/G^a/1$$ M / G a / 1 Queue with Batch Service of Fixed Size - Revisited," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 2897-2912, December.
    • Handle: RePEc:spr:metcap:v:24:y:2022:i:4:d:10.1007_s11009-022-09963-0
    DOI: 10.1007/s11009-022-09963-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-022-09963-0
    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/s11009-022-09963-0?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. S. Pradhan & U. C. Gupta, 2019. "Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process," Annals of Operations Research, Springer, vol. 277(2), pages 161-196, June.
    2. Mohan L. Chaudhry, 1992. "Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1," INFORMS Journal on Computing, INFORMS, vol. 4(3), pages 300-310, August.
    3. Miaomiao Yu & Yinghui Tang, 2018. "Analysis of the Sojourn Time Distribution for M/GL/1 Queue with Bulk-Service of Exactly Size L," Methodology and Computing in Applied Probability, Springer, vol. 20(4), pages 1503-1514, December.
    4. J. Medhi, 1975. "Waiting Time Distribution in a Poisson Queue with a General Bulk Service Rule," Management Science, INFORMS, vol. 21(7), pages 777-782, March.
    5. Jewgeni H. Dshalalow & Lotfi Tadj, 1992. "A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 15, pages 1-6, January.
    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. Gopinath Panda & Veena Goswami, 2023. "Analysis of a Discrete-time Queue with Modified Batch Service Policy and Batch-size-dependent Service," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-18, March.
    2. 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.
    3. Srinivas R. Chakravarthy & Shruti & Alexander Rumyantsev, 2021. "Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1551-1579, December.
    4. Mohan Chaudhry & Abhijit Datta Banik & Sitaram Barik & Veena Goswami, 2023. "A Novel Computational Procedure for the Waiting-Time Distribution (In the Queue) for Bulk-Service Finite-Buffer Queues with Poisson Input," Mathematics, MDPI, vol. 11(5), pages 1-26, February.
    5. Srinivas R. Chakravarthy & Serife Ozkar, 2024. "A Queueing Model with BMAP Arrivals and Heterogeneous Phase Type Group Services," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-30, December.
    6. Stein, William E. & Rapoport, Amnon & Seale, Darryl A. & Zhang, Hongtao & Zwick, Rami, 2007. "Batch queues with choice of arrivals: Equilibrium analysis and experimental study," Games and Economic Behavior, Elsevier, vol. 59(2), pages 345-363, May.
    7. Sergei Dudin & Olga Dudina, 2023. "Analysis of a Multi-Server Queue with Group Service and Service Time Dependent on the Size of a Group as a Model of a Delivery System," Mathematics, MDPI, vol. 11(22), pages 1-20, November.
    8. S. K. Samanta & R. Nandi, 2021. "Queue-Length, Waiting-Time and Service Batch Size Analysis for the Discrete-Time GI/D-MSP (a,b) / 1 / ∞ $^{\text {(a,b)}}/1/\infty $ Queueing System," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1461-1488, December.
    9. Lin, Yu-Hsin & Lee, Ching-En, 2001. "A total standard WIP estimation method for wafer fabrication," European Journal of Operational Research, Elsevier, vol. 131(1), pages 78-94, May.
    10. Yusei Koyama & Ayane Nakamura & Tuan Phung-Duc, 2024. "Sojourn Time Analysis of a Single-Server Queue with Single- and Batch-Service Customers," Mathematics, MDPI, vol. 12(18), pages 1-27, September.
    11. Dieter Fiems & Koen De Turck, 2023. "Analysis of Discrete-Time Queues with Branching Arrivals," Mathematics, MDPI, vol. 11(4), pages 1-13, February.
    12. Souvik Ghosh & A. D. Banik & Joris Walraevens & Herwig Bruneel, 2022. "A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service," 4OR, Springer, vol. 20(2), pages 241-272, June.
    13. Chen, Shih-Pin, 2005. "Parametric nonlinear programming approach to fuzzy queues with bulk service," European Journal of Operational Research, Elsevier, vol. 163(2), pages 434-444, June.
    14. Warren B. Powell, 1987. "Waiting‐time distributions for bulk arrival, bulk service queues with vehicle‐holding and cancellation strategies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 207-227, April.
    15. Nitin Kumar & Umesh Chandra Gupta, 2022. "Markovian Arrival Process Subject to Renewal Generated Binomial Catastrophes," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 2287-2312, December.
    16. Rapoport, Amnon & Stein, William E. & Mak, Vincent & Zwick, Rami & Seale, Darryl A., 2010. "Endogenous arrivals in batch queues with constant or variable capacity," Transportation Research Part B: Methodological, Elsevier, vol. 44(10), pages 1166-1185, December.
    17. Dieter Claeys & Koenraad Laevens & Joris Walraevens & Herwig Bruneel, 2010. "Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(1), pages 1-23, August.
    18. Suryadeepto Nag & Siddhartha P. Chakrabarty & Sankarshan Basu, 2021. "Single Event Transition Risk: A Measure for Long Term Carbon Exposure," Papers 2107.06518, arXiv.org, revised May 2022.

    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:metcap:v:24:y:2022:i:4:d:10.1007_s11009-022-09963-0. 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.