Hostname: page-component-7bb8b95d7b-w7rtg Total loading time: 0 Render date: 2024-09-12T22:12:27.472Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal control of the service rate in an M/G/1 queueing system

Published online by Cambridge University Press:  01 July 2016

Bharat T. Doshi
Bharat T. Doshi*
Affiliation:
Rutgers University
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider an M/G/1 queue in which the service rate is subject to control. The control is exercised continuously and is based on the observations of the residual workload process. For both the discounted cost and the average cost criteria we obtain conditions which are sufficient for a stationary policy to be optimal. When the service cost rate and the holding cost rates are non-decreasing and convex it is shown that these sufficient conditions are satisfied by a monotonic policy, thus showing its optimality.

Keywords

M/G/1 QUEUEOPTIMAL CONTROLCONTINUOUS-TIME MARKOV DECISION PROCESSSERVICE RATE CONTROL
Type
Research Article
Information
Advances in Applied Probability , Volume 10 , Issue 3 , September 1978 , pp. 682 - 701
Copyright
Copyright © Applied Probability Trust 1978 

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.)

References

Crabill, T., Gross, D. and Magazine, M. (1973) A survey of research on optimal design and control of queues. Tech. Rpt. #T-280, George Washington University.Google Scholar
Doshi, B. (1974) Continuous time control of Markov processes on an arbitrary state space. , Cornell University. Also Tech. Sum. Rpt. #1468, Math. Res. Ctr., Madison, Wisconsin.Google Scholar
Doshi, B. (1976a) Continuous time control of Markov processes on an arbitrary state space: discounted rewards. Ann. Statist. 4, 1219–1235.Google Scholar
Doshi, B. (1976b) Continuous time control of Markov processes on an arbitrary state space: average return criterion. Stoch. Proc. Appl., 4, 55–77.CrossRefGoogle Scholar
Doshi, B. (1977) Continuous time control of the arrival process in an M/G/1 queue. Stoch. Proc. Appl., 5.CrossRefGoogle Scholar
Heyman, D. (1968) Optimal operating policies for M/G/1 queueing systems. Opns Res. 16, 362–382.CrossRefGoogle Scholar
Lippman, S. (1975) Applying a new device in the optimization of exponential queueing systems. Opns Res. 23, 687–710.CrossRefGoogle Scholar
Mandl, P. (1968) Analytical Treatment of One dimensional Markov Processes. Academy of Sciences, Prague; Springer-Verlag, Berlin.Google Scholar
Mitchell, B. (1973) Optimal service-rate selection in an M/G/1 queue. SIAM J. Appl. Math. 24, 19–35.CrossRefGoogle Scholar
Prabhu, N. U. and Stidham, S. (1974) Optimal control of queueing systems. In Mathematical Methods in Queueing Theory. Lecture Notes in Economics and Mathematical Systems 98, Springer-Verlag, Berlin, 263–294.CrossRefGoogle Scholar
Ross, S. (1968a) Non-discounted denumerable Markovian decision models. Ann. Math. Statist. 39, 412–423.CrossRefGoogle Scholar
Ross, S. (1968b) Arbitrary state Markovian decision processes. Ann. Math. Statist. 39, 2118–2122.CrossRefGoogle Scholar
Rudin, W. (1964) Principles of Mathematical Analysis. McGraw-Hill, New York.Google Scholar
Sobel, M. (1974) Optimal operation of queues. In Mathematical Methods in Queueing Theory. Lecture Notes in Economics and Mathematical Systems 98, Springer-Verlag, Berlin, 231–261.CrossRefGoogle Scholar
Thatcher, R. (1968) Optimal single-channel service policies for stochastic arrivals. ORC-68-16, OR Center, University of California, Berkeley.Google Scholar