IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v48y2024i2p256-271.html
   My bibliography  Save this article

The server allocation problem for Markovian queueing networks

Author

Listed:
  • Anderson Ribeiro Duarte

Abstract

Manufacturing systems often need to improve productivity to meet customer demand drastically. In the design phase of these systems, one of the most significant problems is how to allocate resources (servers) to design efficient queueing systems. Queueing networks with multiple servers, arbitrary acyclic topologies with Markovian arrivals, and services are considered in this paper. We present an approach for optimal server allocation in several topologies (series, merge, and split). The methodology uses a multi-objective heuristic strategy using the simulated annealing algorithm. Server utilisation performance is maximised simultaneously with the minimisation of the expected overall time of customers in the queueing network. Results from computational experiments show the efficacy of the proposal.

Suggested Citation

  • Anderson Ribeiro Duarte, 2024. "The server allocation problem for Markovian queueing networks," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 48(2), pages 256-271.
    • Handle: RePEc:ids:ijsoma:v:48:y:2024:i:2:p:256-271
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=138931
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijsoma:v:48:y:2024:i:2:p:256-271. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=150 .

    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.