Skip to main content Accessibility help
×
Home

OPTIMALITY OF TRUNK RESERVATION FOR AN M/M/K/N QUEUE WITH SEVERAL CUSTOMER TYPES AND HOLDING COSTS

  • Eugene A. Feinberg (a1) and Fenghsu Yang (a1)

Abstract

In this article we study optimal admission to an M/M/k/N queue with several customer types. The reward structure consists of revenues collected from admitted customers and holding costs, both of which depend on customer types. This article studies average rewards per unit time and describes the structures of stationary optimal, canonical, bias optimal, and Blackwell optimal policies. Similar to the case without holding costs, bias optimal and Blackwell optimal policies are unique, coincide, and have a trunk reservation form with the largest optimal control level for each customer type. Problems with one holding cost rate have been studied previously in the literature.

Copyright

References

Hide All
1.Blackwell, D. (1962). Discrete dynamic programming. Annals of Mathematical Statistics 33: 719726.
2.Fan-Orzechowski, X. & Feinberg, E.A. (2006). Optimality of randomized trunk reservation for a problem with a single constraint. Applied Probability Trust 38: 199220.
3.Fan-Orzechowski, X. & Feinberg, E.A. (2007). Optimality of randomized trunk reservation for a problem with multiple constraints. Probability in the Engineering and Informational Sciences 21: 189200.
4.Feinberg, E.A. & Reiman, M.I. (1994). Optimality of randomized trunk reservation. Probability in the Engineering and Informational Sciences 8: 483489.
5.Howard, R. (1960). Dynamic programming and Markov processes. Cambridge, MA: MIT press.
6.Haviv, M. & Puterman, M.L. (1998). Bias optimality in controlled queueing systems. Journal of Applied Probability 35: 136150.
7.Helm, W.E. & Waldman, K.-H. (1984). Optimal control of arrivals to multiserver queues in a random environment. Journal of Applied Probability 21: 602615.
8.Johansen, S.G. (1977). Controlled arrivals in queueing systems with state dependent exponential service times. Technical Report. Aarhus University, Denmark.
9.Knudsen, N.C. (1972). Individual and social optimization in a multiserver queue with a general cost-benefit structure. Econometrica 40: 515528.
10.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: 309327.
11.Miller, B.L. (1969). A queueing reward system with several customer classes. Management Science 16: 235245.
12.Müller, A. & Stoyan, D. (2002). Comparison methods for stochastic models and risks. New York: Wiley.
13.Naor, P. (1969). The regulation of queue size by levying tolls. Econometrica 37: 1524.
14.Puterman, M.L. (1994). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley.
15.Stidham, S. (1978). Socially and individually optimal control of arrivals to a GI/M/1 queue. Management Science 24: 15981610.
16.Stidham, S. (1985). Optimal control of admission to a queueing system. IEEE Transactions on Automatic Control 30: 705713.
17.Veinott, A.F. Jr. (1966). On finding optimal policies in discrete dynamic programming with no discounting. Annals of Mathematical Statistics 37: 12841294.
18.Yechiali, U. (1971). On optimal balking rules and toll charges in the GI/M/1 queueing process. Operations Research 19: 349370.
19.Yechiali, U. (1972). Customers’ optimal joining rules for the GI/M/s queue. Management Science 18: 434443.
20.Yushkevich, A.A. & Feinberg, EA. (1979). On homogeneous Markov decision models with continuous time and finite or countable state spaces. Theory of Probability and its Applications 24: 156161.

Related content

Powered by UNSILO

OPTIMALITY OF TRUNK RESERVATION FOR AN M/M/K/N QUEUE WITH SEVERAL CUSTOMER TYPES AND HOLDING COSTS

  • Eugene A. Feinberg (a1) and Fenghsu Yang (a1)

Metrics

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.