The server allocation problem for Markovian queueing networks
by Anderson Ribeiro Duarte
International Journal of Services and Operations Management (IJSOM), Vol. 48, No. 2, 2024

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.

Online publication date: Tue, 04-Jun-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com