| Article ID: | iaor19992677 |
| Country: | Germany |
| Volume: | 47 |
| Issue: | 2 |
| Start Page Number: | 317 |
| End Page Number: | 336 |
| Publication Date: | Jan 1998 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Hordijk A., Loeve A., Tiggelman J. |
| Keywords: | queueing networks |
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.