IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v25y2023i1d10.1007_s11009-023-09985-2.html
   My bibliography  Save this article

Analysis of a Discrete-time Queue with Modified Batch Service Policy and Batch-size-dependent Service

Author

Listed:
  • Gopinath Panda

    (Dhirubhai Ambani Institute of Information and Communication Technology)

  • Veena Goswami

    (Kalinga Institute of Industrial Technology)

Abstract

We consider a discrete-time single server batch service queue, with a modified bulk service rule, where jobs will process in batches with a minimum batch size of L and maximum batch size K. In addition, we let jobs join the service if the server has started the service and has less than K jobs. The service times of the batches depend on the size of the service batch. We find explicit analytical expressions for the joint and marginal probability distribution of the number of jobs in the system, in the queue, and with the server. We also compute several performance measures and illustrate their dependence on various system parameters. Finally, we match the presented results with some results in the literature and establish a link to the continuous-time counterpart.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:metcap:v:25:y:2023:i:1:d:10.1007_s11009-023-09985-2
    DOI: 10.1007/s11009-023-09985-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-023-09985-2
    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-023-09985-2?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. Claeys, Dieter & Walraevens, Joris & Laevens, Koenraad & Bruneel, Herwig, 2010. "A queueing model for general group screening policies and dynamic item arrivals," European Journal of Operational Research, Elsevier, vol. 207(2), pages 827-835, December.
    2. Bar-Lev, Shaul K. & Parlar, Mahmut & Perry, David & Stadje, Wolfgang & Van der Duyn Schouten, Frank A., 2007. "Applications of bulk queues to group testing models with incomplete identification," European Journal of Operational Research, Elsevier, vol. 183(1), pages 226-237, November.
    3. Warren B. Powell & Pierre Humblet, 1986. "The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure," Operations Research, INFORMS, vol. 34(2), pages 267-275, April.
    4. Guy L. Curry & Richard M. Feldman, 1985. "An M/M/1 queue with a general bulk service rule," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 32(4), pages 595-603, November.
    5. Bar-Lev, S.K. & Parlar, M. & Perry, D. & Stadje, W. & van der Duyn Schouten, F.A., 2007. "Applications of bulk queues to group testing models with incomplete identification," Other publications TiSEM 0b1bfa5e-c1e6-43ec-9684-1, Tilburg University, School of Economics and Management.
    6. Nam K. Kim & Kyung C. Chae & Mohan L. Chaudhry, 2004. "An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions," Operations Research, INFORMS, vol. 52(5), pages 756-764, October.
    7. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Anuradha Banerjee & Priti Lata, 2024. "Complete Analysis of $$M/G_{r}^{(a,b)}/1/N$$ M / G r ( a , b ) / 1 / N Queue with Second Optional Service," Methodology and Computing in Applied Probability, Springer, vol. 26(4), pages 1-33, December.

    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. S. R. Chakravarthy & Arunava Maity & U. C. Gupta, 2017. "An ‘(s, S)’ inventory in a queueing system with batch service facility," Annals of Operations Research, Springer, vol. 258(2), pages 263-283, November.
    2. S. Pradhan & U.C. Gupta & S.K. Samanta, 2016. "Queue-length distribution of a batch service queue with random capacity and batch size dependent service: M / G r Y / 1 $M/{G^{Y}_{r}}/1$," OPSEARCH, Springer;Operational Research Society of India, vol. 53(2), pages 329-343, June.
    3. Yongxi Cheng & Ding-Zhu Du & Yinfeng Xu, 2014. "A Zig-Zag Approach for Competitive Group Testing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 677-689, November.
    4. 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.
    5. Yu, Miaomiao & Alfa, Attahiru Sule, 2015. "Algorithm for computing the queue length distribution at various time epochs in DMAP/G(1, a, b)/1/N queue with batch-size-dependent service time," European Journal of Operational Research, Elsevier, vol. 244(1), pages 227-239.
    6. Yongxi Cheng & Ding-Zhu Du & Feifeng Zheng, 2015. "A new strongly competitive group testing algorithm with small sequentiality," Annals of Operations Research, Springer, vol. 229(1), pages 265-286, June.
    7. 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.
    8. Abhijit Datta Banik & Souvik Ghosh & M. L. Chaudhry, 2020. "On the optimal control of loss probability and profit in a GI/C-BMSP/1/N queueing system," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 144-162, March.
    9. 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.
    10. Claeys, Dieter & Walraevens, Joris & Laevens, Koenraad & Bruneel, Herwig, 2010. "A queueing model for general group screening policies and dynamic item arrivals," European Journal of Operational Research, Elsevier, vol. 207(2), pages 827-835, December.
    11. Yi, Xeung W. & Kim, Nam K. & Yoon, Bong K. & Chae, Kyung C., 2007. "Analysis of the queue-length distribution for the discrete-time batch-service Geo/Ga,Y/1/K queue," European Journal of Operational Research, Elsevier, vol. 181(2), pages 787-792, September.
    12. James J. Kim & Douglas G. Down & Mohan Chaudhry & Abhijit Datta Banik, 2022. "Difference Equations Approach for Multi-Server Queueing Models with Removable Servers," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1297-1321, September.
    13. Bar-Lev, Shaul K. & Boxma, Onno & Kleiner, Igor & Perry, David & Stadje, Wolfgang, 2017. "Recycled incomplete identification procedures for blood screening," European Journal of Operational Research, Elsevier, vol. 259(1), pages 330-343.
    14. 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.
    15. Shaul K. Bar-Lev & Hans Blanc & Onno Boxma & Guido Janssen & David Perry, 2013. "Tandem Queues with Impatient Customers for Blood Screening Procedures," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 423-451, June.
    16. 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.
    17. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
    18. Papadaki, Katerina P. & Powell, Warren B., 2002. "Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem," European Journal of Operational Research, Elsevier, vol. 142(1), pages 108-127, October.
    19. Wang, Xiaofang & Zhuang, Jun, 2011. "Balancing congestion and security in the presence of strategic applicants with private information," European Journal of Operational Research, Elsevier, vol. 212(1), pages 100-111, July.
    20. Xu, Jianjun & Serrano, Alejandro & Lin, Bing, 2017. "Optimal production and rationing policy of two-stage tandem production system," International Journal of Production Economics, Elsevier, vol. 185(C), pages 100-112.

    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:25:y:2023:i:1:d:10.1007_s11009-023-09985-2. 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.