The server allocation problem for Markovian queueing networks

Anderson Ribeiro Duarte

International Journal of Services and Operations Management, 2024, vol. 48, issue 2, 256-271

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.

Keywords: multi-objective optimisation; simulated annealing; productivity; expected overall time. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=138931 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:48:y:2024:i:2:p:256-271

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().