Hostname: page-component-77f85d65b8-2tv5m Total loading time: 0 Render date: 2026-03-28T06:17:18.870Z Has data issue: false hasContentIssue false
  • English
  • Français

Analysis of a Customer Assignment Model with No State Information

Published online by Cambridge University Press:  27 July 2009

A. Hordijk ,
G. M. Koole  and
J. A. Loeve
A. Hordijk
Affiliation:
University of LeidenNiels Bohrweg 1, 2333 CA Leiden, The Netherlands
G. M. Koole
Affiliation:
CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands
J. A. Loeve
Affiliation:
University of Leiden, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we analyze a queueing network consisting of parallel queues and arriving customers that have to be assigned to one of the queues. The assignment rule may not depend on the numbers of customers in the queues. Our goal is to find a policy that is optimal with respect to the long-run average cost. We will consider two cases: holding costs and waiting times. A recently developed algorithm for Markov decision chains with partial state information is applied. It turns out that the periodic policies found by this algorithm are close, if not equal, to the optimal ones.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 8 , Issue 3 , July 1994 , pp. 419 - 429
Copyright
Copyright © Cambridge University Press 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Chang, C.S. (1992). A new ordering for stochastic majorization: Theory and applications. Advances in Applied Probability 24: 604–634.CrossRefGoogle Scholar
2.Combé, M.B. & Boxma, O.J. (1993). Optimization of static traffic allocation policies. Technical Report BS-R9302, CWI, Amsterdam (to appear in Theoretical Computer Science A 125: 17–43.Google Scholar
3.Gross, D. & Harris, C.M. (1974). Fundamentals of queueing theory. New York: John Wiley & Sons.Google Scholar
4.Hajek, B. (1984). Optimal control of two interacting service stations. IEEE Transactions on Automated Control 29: 491–499.CrossRefGoogle Scholar
5.Hajek, B. (1985). Extremal splitting of point processes. Mathematics of Operations Research 10: 543–556.CrossRefGoogle Scholar
6.Hordijk, A. & Koole, G. (1990). On the optimality of the generalized shortest queue policy. Probability in the Engineering and informational Sciences 4: 477–487.CrossRefGoogle Scholar
7.Hordijk, A. & Koole, G. (1992). On the assignment of customers to parallel queues. Probability in the Engineering and Informational Sciences 6: 495–511.CrossRefGoogle Scholar
8.Hordijk, A. & Loeve, J.A. (1993). Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy. Technical Report TW-93-10, University of Leiden, Leiden (to appear in ZOR-Mathematical Methods of Operations Research 40 (3), 1994).Google Scholar
9.Koole, G. (1992). On the optimality of FCFS for networks of multi-server queues. Technical Report BS-R9235, CWI, Amsterdam.Google Scholar
10.Kulkarni, V.G. & Serin, Y. (1990). Optimal implementable policies: Average cost and minimax criteria. Technical Report UNC/OR TR-90/9, Department of Operations Research, University of North Carolina, Chapel Hill.Google Scholar
11.Liu, Z. & Towsley, D. (1992). Optimality of the round robin routing policy. COINS Technical Report 92-55, University of Massachusetts at Amherst.Google Scholar
12.Menich, R. & Serfozo, R.F. (1991). Monotonicity and optimality of symmetric parallel processing systems. Queueing Systems, Theory and Applications 9: 403–418.CrossRefGoogle Scholar
13.Towsley, D. & Sparaggis, P.D. (1993). Optimal routing in systems with ILR service time distributions. CMPSCI Technical Report 93–13, University of Massachusetts at Amherst.Google Scholar
14.Towsley, D., Sparaggis, P.D., & Cassandras, C.G. (1992). Optimal routing and buffer allocation for a class of finite capacity queueing systems. IEEE Transactions on Automated Control 37: 1446–1451.CrossRefGoogle Scholar
15.Walrand, J. (1988). An introduction to queueing networks. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar