Skip to main content Accessibility help


  • Kenneth C. Chong (a1), Shane G. Henderson (a2) and Mark E. Lewis (a3)


We consider the problem of routing and admission control in a loss system featuring two classes of arriving jobs (high-priority and low-priority jobs) and two types of servers, in which decision-making for high-priority jobs is forced, and rewards influence the desirability of each of the four possible routing decisions. We seek a policy that maximizes expected long-run reward, under both the discounted reward and long-run average reward criteria, and formulate the problem as a Markov decision process. When the reward structure favors high-priority jobs, we demonstrate that there exists an optimal monotone switching curve policy with slope of at least −1. When the reward structure favors low-priority jobs, we demonstrate that the value function, in general, lacks structure, which complicates the search for structure in optimal policies. However, we identify conditions under which optimal policies can be characterized in greater detail. We also examine the performance of heuristic policies in a brief numerical study.



Hide All
1. Altman, E., Jimenez, T. & Koole, G. (2001). On optimal call admission control in resource-sharing system. IEEE Transactions on Communications 49(9): 16591668.
2. Bakalos, G., Mamali, M., Komninos, C., Koukou, E., Tsantilas, A., Tzima, S. & Rosenberg, T. (2011). Advanced life support versus basic life support in the pre-hospital setting: a meta-analysis. Resuscitation 82(9): 11301137.
3. Bell, S.L. & Williams, R.J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy. The Annals of Applied Probability 11(3): 608649.
4. Berman, O. (1981). Dynamic repositioning of indistinguishable service units on transportation networks. Transportation Science 15(2): 115136.
5. Berman, O. (1981). Repositioning of distinguishable urban service units on networks. Computers & Operations Research 8(2): 105118.
6. Bhulai, S. & Koole, G. (2000). A queueing model for call blending in call centers. IEEE Transactions on Automatic Control 48(8): 14341438.
7. Blanc, J.P.C., de Wall, P.R., Nain, P. & Towsley, D. (1992). Optimal control of admission to a multi-server queue with two arrival streams. IEEE Transactions on Automatic Control 37(6): 785797.
8. Carrizosa, E., Conde, E. & Muñoz-Márquez, M. (1998). Admission policies in loss queueing models with heterogeneous arrivals. Management Science 44(3): 311320.
9. Chong, K.C., Henderson, S.G. & Lewis, M.E. (2016). The vehicle mix decision in emergency medical service systems. Manufacturing & Service Operations Management 18(3): 347360.
10. Derman, C., Lieberman, G.J. & Ross, S.M. (1972). A sequential stochastic assignment problem. Management Science 18(7): 349355.
11. Down, D.G. & Lewis, M.E. (2010). The N-network model with upgrades. Journal of Information Science and Engineering 24(2): 171200.
12. Feinberg, E.A. & Reiman, M.I. (1994). Optimality of randomized trunk reservation. Journal of Information Science and Engineering 8(4): 463489.
13. Gans, N. & Savin, S. (2007). Pricing and capacity rationing for rentals with uncertain durations. Management Science 53(3): 390407.
14. Gans, N. & Zhou, Y.-P. (2003). A call-routing problem with service-level constraints. Operations Research 51(2): 255271.
15. Harrison, J.M. (1998). Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies. The Annals of Applied Probability 8(3): 822848.
16. Jacobs, L.M., Sinclair, A., Beiser, A. & D'agostino, R.B. (1984). Prehospital advanced life support: benefits in trauma. The Journal of Trauma 24(1): 812.
17. Jarvis, J.P. (1975). Optimization in stochastic service systems with distinguishable servers. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA.
18. Lewis, M.E., Ayhan, H. & Foley, R.D. (1999). Bias optimality in a queue with admission control. Probability in the Engineering and Informational Sciences 13(3): 309327.
19. Lippman, S.A. (1975). Applying a new device in the optimization of exponential queuing systems. Operations Research 23(4): 687710.
20. McLay, L.A. & Mayorga, M.E. (2013). A model for optimally dispatching ambulances to emergency calls with classification errors in patient priorities. IIE Transactions 45(1): 124.
21. Miller, B.L. (1969). A queueing reward system with several customer classes. Management Science 16(3): 234245.
22. Örmeci, E.L. & van der Wal, J. (2006). Admission policies for a two class loss system with general interarrival times. Stochastic Models 22(1): 3753.
23. Papier, F. & Thonemann, U.W. (2010). Capacity rationing in stochastic rental systems with advance demand information. Operations Research 58(2): 274288.
24. Puterman, M.L. (1994). Markov decision processes: discrete stochastic dynamic programming. Hoboken, NJ: John Wiley and Sons.
25. Ross, S.M. & Wu, D.T. (2013). A generalized coupon collecting model as a parsimonious optimal stochastic assignment model. Annals of Operations Research 208(1): 133146.
26. Ross, S.M. & Wu, D.T. (2015). A stochastic assignment problem. Naval Research Logistics 62(1): 2331.
27. Savin, S.V., Cohen, M.A., Gans, N. & Katalan, Z. (2005). Capacity management in rental businesses with two customer bases. Operations Research 53(4): 617631.
28. Serfozo, R.F. (1979). Technical notean equivalence between continuous and discrete time Markov decision processes. Operations Research 27(3): 616620.
29. Stidham, S. (1985). Optimal control of admission to a queueing system. IEEE Transactions on Automatic Control 30(8): 705713.
30. Stidham, S. & Weber, R. (1993). A survey of Markov decision models for control of networks of queues. Queueing Systems 13: 291314. doi: 10.1007/bf01158935.
31. Zhang, L. (2012). Simulation optimisation and Markov models for dynamic ambulance redeployment. Ph.D. thesis, The University of Auckland, Auckland, New Zealand.


Related content

Powered by UNSILO
Type Description Title
Supplementary materials

Chong supplementary material

 PDF (282 KB)
282 KB


  • Kenneth C. Chong (a1), Shane G. Henderson (a2) and Mark E. Lewis (a3)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.