Analysis of a finite-source customer assignment model with no state information

In this paper we analyse a closed queueing network in which customers have to be assigned to parallel queues. The routing decision may not depend on the numbers of customers in the queues. We present an algorithm and we show that it computes an average optimal policy in case of exponential service times. The algorithm also works for non-exponential service times, in which case periodic policies are found. Copyright Physica-Verlag 1998

MoreLess

Year of publication:	1998
Authors:	Hordijk, Arie ; Loeve, Anneke ; Tiggelman, Jeroen
Published in:	Mathematical Methods of Operations Research. - Springer. - Vol. 47.1998, 2, p. 317-336
Publisher:	Springer
Subject:	Static customer routing \| algorithm \| closed queueing network

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010950371