IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i20p2624-d658780.html
   My bibliography  Save this article

Algorithmic Analysis of Finite-Source Multi-Server Heterogeneous Queueing Systems

Author

Listed:
  • Dmitry Efrosinin

    (Insitute for Stochastics, Johannes Kepler University Linz, Altenbergerstrasse 69, 4040 Linz, Austria
    Department of Information Technologies, Faculty of Mathematics and Natural Sciences, Peoples’ Friendship University of Russia (RUDN University), Miklukho-Maklaya 6, 117198 Moscow, Russia
    V.A. Trapeznikov Institute of Control Sciences of RAS, Profsoyuznaya 65, 117997 Moscow, Russia)

  • Natalia Stepanova

    (V.A. Trapeznikov Institute of Control Sciences of RAS, Profsoyuznaya 65, 117997 Moscow, Russia)

  • Janos Sztrik

    (Department of Informatics and Networks, Faculty of Informatics, University of Debrecen, Egyetem tér 1, 4032 Debrecen, Hungary)

Abstract

The paper deals with a finite-source queueing system serving one class of customers and consisting of heterogeneous servers with unequal service intensities and of one common queue. The main model has a non-preemptive service when the customer can not change the server during its service time. The optimal allocation problem is formulated as a Markov-decision one. We show numerically that the optimal policy which minimizes the long-run average number of customers in the system has a threshold structure. We derive the matrix expressions for performance measures of the system and compare the main model with alternative simplified queuing systems which are analysed for the arbitrary number of servers. We observe that the preemptive heterogeneous model operating under a threshold policy is a good approximation for the main model by calculating the mean number of customers in the system. Moreover, using the preemptive and non-preemptive queueing models with the faster server first policy the lower and upper bounds are calculated for this mean value.

Suggested Citation

  • Dmitry Efrosinin & Natalia Stepanova & Janos Sztrik, 2021. "Algorithmic Analysis of Finite-Source Multi-Server Heterogeneous Queueing Systems," Mathematics, MDPI, vol. 9(20), pages 1-24, October.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:20:p:2624-:d:658780
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/20/2624/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/20/2624/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Dmitry Efrosinin & Natalia Stepanova & Janos Sztrik & Andreas Plank, 2020. "Approximations in Performance Analysis of a Controllable Queueing System with Heterogeneous Servers," Mathematics, MDPI, vol. 8(10), pages 1-18, October.
    2. Delasay, Mohammad & Kolfal, Bora & Ingolfsson, Armann, 2012. "Maximizing throughput in finite-source parallel queue systems," European Journal of Operational Research, Elsevier, vol. 217(3), pages 554-559.
    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. Zhao, Yaping & Xu, Xiaoyun & Li, Haidong & Liu, Yanni, 2016. "Prioritized customer order scheduling to maximize throughput," European Journal of Operational Research, Elsevier, vol. 255(2), pages 345-356.
    2. Dmitry Efrosinin & Natalia Stepanova, 2021. "Optimal Open-Loop Routing and Threshold-Based Allocation in TWO Parallel QUEUEING Systems with Heterogeneous Servers," Mathematics, MDPI, vol. 9(21), pages 1-18, October.
    3. Ta, Chung H. & Ingolfsson, Armann & Doucette, John, 2013. "A linear model for surface mining haul truck allocation incorporating shovel idle probabilities," European Journal of Operational Research, Elsevier, vol. 231(3), pages 770-778.
    4. Isaac Grosof & Mor Harchol-Balter & Alan Scheller-Wolf, 2022. "WCFS: a new framework for analyzing multiserver systems," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 143-174, October.
    5. Brooks, James D. & Kar, Koushik & Mendonça, David J., 2016. "Allocation of flows in closed bipartite queueing networks," European Journal of Operational Research, Elsevier, vol. 255(2), pages 333-344.
    6. Nika Ivanova, 2023. "On Importance of Sensitivity Analysis on an Example of a k -out-of- n System," Mathematics, MDPI, vol. 11(5), pages 1-18, February.

    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:gam:jmathe:v:9:y:2021:i:20:p:2624-:d:658780. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.