IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v24y2022i3d10.1007_s11009-021-09848-8.html
   My bibliography  Save this article

Difference Equations Approach for Multi-Server Queueing Models with Removable Servers

Author

Listed:
  • James J. Kim

    (Royal Canadian Air Force (RCAF))

  • Douglas G. Down

    (McMaster University)

  • Mohan Chaudhry

    (Royal Military College of Canada)

  • Abhijit Datta Banik

    (Indian Institute of Technology)

Abstract

We consider an extended form of the MX/M/c queue with two types of server groups: Static as well as dynamic (which turn on/off in a state-dependent manner) servers. The two server groups may have homogenous or non-homogenous service rates. The model is further extended to feature setup and delayed-off times, finite capacity, and k staffing levels. This class of queues is solved via the difference equations approach, which addresses narratives in the literature and achieves higher numerical efficiency than the direct method. While the model of this queueing system is not new, the methodology for solving it is. Comparisons between our model and classic queues are provided followed by concluding remarks, including a summary of key observations.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:metcap:v:24:y:2022:i:3:d:10.1007_s11009-021-09848-8
    DOI: 10.1007/s11009-021-09848-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-021-09848-8
    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-021-09848-8?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. Terekhov, Daria & Christopher Beck, J., 2009. "An extended queueing control model for facilities with front room and back room operations and mixed-skilled workers," European Journal of Operational Research, Elsevier, vol. 198(1), pages 223-231, October.
    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. Zhe George Zhang, 2009. "Performance Analysis of a Queue with Congestion-Based Staffing Policy," Management Science, INFORMS, vol. 55(2), pages 240-251, February.
    4. M. L. Chaudhry & U. C. Gupta & V. Goswami, 2001. "Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GI X /Geom/m," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 172-180, August.
    5. Mohan L. Chaudhry & Carl M. Harris & William G. Marchal, 1990. "Robustness of Rootfinding in Single-Server Queueing Models," INFORMS Journal on Computing, INFORMS, vol. 2(3), pages 273-286, August.
    6. Mohan L. Chaudhry & James J. Kim, 2016. "Analytically elegant and computationally efficient results in terms of roots for the $$GI^{X}/M/c$$ G I X / M / c queueing system," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 237-257, February.
    7. 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.
    8. Carl M. Harris & Percy H. Brill & Martin J. Fischer, 2000. "Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 261-271, November.
    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. J. J. Kim & M. L. Chaudhry & V. Goswami & A. D. Banik, 2021. "A New and Pragmatic Approach to the GIX/Geo/c/N Queues Using Roots," Methodology and Computing in Applied Probability, Springer, vol. 23(1), pages 273-289, March.
    2. Mohan L. Chaudhry & James J. Kim, 2016. "Analytically elegant and computationally efficient results in terms of roots for the $$GI^{X}/M/c$$ G I X / M / c queueing system," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 237-257, February.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. S. K. Samanta, 2020. "Waiting-time analysis of D-$${ BMAP}{/}G{/}1$$BMAP/G/1 queueing system," Annals of Operations Research, Springer, vol. 284(1), pages 401-413, January.
    8. Mohan Chaudhry & Veena Goswami, 2022. "The Geo / G a , Y /1/ N Queue Revisited," Mathematics, MDPI, vol. 10(17), pages 1-17, September.
    9. Miaomiao Yu & Yinghui Tang, 2022. "Analysis of a renewal batch arrival queue with a fault-tolerant server using shift operator method," Operational Research, Springer, vol. 22(3), pages 2831-2858, July.
    10. M. L. Chaudhry & Veena Goswami, 2019. "The Queue Geo/G/1/N + 1 Revisited," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 155-168, March.
    11. M. L. Chaudhry, 1992. "Computing stationary queueing‐time distributions of GI/D/1 and GI/D/c queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(7), pages 975-996, December.
    12. J. S. H. van Leeuwaarden, 2006. "Delay Analysis for the Fixed-Cycle Traffic-Light Queue," Transportation Science, INFORMS, vol. 40(2), pages 189-199, May.
    13. Pinai Linwong* & Nei Kato* & Yoshiaki Nemoto*, 2004. "A Polynomial Factorization Approach for the Discrete Time GIX/>G/1/K Queue," Methodology and Computing in Applied Probability, Springer, vol. 6(3), pages 277-291, September.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. P. Patrick Wang, 1993. "Static and dynamic scheduling of customer arrivals to a single‐server system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 345-360, April.
    19. 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.
    20. S. K. Samanta & M. L. Chaudhry & A. Pacheco, 2016. "Analysis of B M A P/M S P/1 Queue," Methodology and Computing in Applied Probability, Springer, vol. 18(2), pages 419-440, June.

    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:3:d:10.1007_s11009-021-09848-8. 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.