Skip to main content Accessibility help

Average optimal policies in a controlled queueing system with dual admission control

  • Mark E. Lewis (a1)


We consider a controlled M/M/1 queueing system where customers may be subject to two potential rejections. The first occurs upon arrival and is dependent on the number of customers in the queue and the service rate of the customer currently in service. The second, which may or may not occur, occurs immediately prior to the customer receiving service. That is, after each service completion the customer in the front of the queue is assessed and the service rate of that customer is revealed. If the second decision-maker recommends rejection, the customer is denied service with a fixed probability. We show the existence of long-run average optimal monotone switching-curve policies. Further, we show that the average reward is increasing in the probability that the second decision-maker's recommendation of rejection is honored. Applications include call centers with delayed classifications and manufacturing systems when the server is responsible for multiple tasks.


Corresponding author

Postal address: Department of Industrial and Operations Engineering, University of Michigan, 1205 Beal Avenue, Ann Arbor, MI 48109-2117, USA. Email address:


Hide All
Altman, E. (1996). Non zero-sum stochastic games in admission, service, and routing control in queueing systems. Queueing Systems 23, 256279.
Altman, E. (1999). A Markov game approach for optimal routing into a queueing network. In Stochastic and Differential Games (Ann. Int. Soc. Dynamic Games 5), eds Bardi, M., Raghavan, T. E. S. and Parthasarathy, T. Birkhäuser, Boston, pp. 359376.
Altman, E. (2001). Applications of Markov decision processes in telecommunications: a survey. To appear in Markov Decision Processes: Models, Methods, Directions and Open Problems, eds Feinberg, E. and Schwartz, A. Kluwer, Dordrecht.
Altman, E., and Stidham, S. Jr. (1995). Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information. Queueing Systems 21, 267291.
Ghoneim, H. A., and Stidham, S. Jr. (1985). Control of arrivals to two queues in series. Eur. J. Operat. Res. 21, 399409.
Hajek, B. (1984). Optimal control of two interacting service stations. IEEE Trans. Automatic Control 29, 491499.
Helm, W. E., and Waldmann, K.-H. (1984). Optimal control of arrivals to multi-server queues in a random environment. J. Appl. Prob. 21, 602615.
Hernández-Lerma, O., and Lasserre, J. B. (1996). Discrete-Time Markov Control Processes: Basic Optimality Criteria. Springer, New York.
Heyman, D. P. (1968). Optimal operating policies for M/G/1 queueing systems. Operat. Res. 16, 362382.
Lewis, M. E., and Puterman, M. L. (2000). A note on bias optimality in controlled queueing systems. J. Appl. Prob. 37, 300305.
Lewis, M. E., and Puterman, M. L. (2001). A probabilistic analysis of bias optimality in unichain Markov decision processes. IEEE Trans. Automatic Control 46, 15.
Lippman, S. A. (1975). Applying a new device in the optimization of exponential queueing systems. Operat. Res. 23, 687712.
Lippman, S. A., and Ross, S. M. (1971). The streetwalker's dilemma: a job shop model. SIAM J. Appl. Math. 20, 336342.
Miller, B. L. (1969). A queueing reward system with several customer classes. Management Sci. 16, 234245.
Puterman, M. L. (1994). Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley, New York.
Stidham, S. Jr. (1985). Optimal control of admission to a queueing system. IEEE Trans. Automatic Control 30, 705713.
Xu, S. H., and Shanthikumar, J. G. (1993). Optimal expulsion control—a dual approach to admission control of an ordered-entry system. Operat. Res. 41, 11371152.
Yadin, M., and Naor, P. (1963). Queueing systems with a removable service station. Operat. Res. Quart. 14, 393405.


MSC classification

Related content

Powered by UNSILO

Average optimal policies in a controlled queueing system with dual admission control

  • Mark E. Lewis (a1)


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.