Abstract
We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding costs per unit time which is a nonnegative nondecreasing right-continuous function of a current workload in the system. We prove an old conjecture that D-policies are optimal for the average cost per unit time criterion. It means that for this criterion there is an optimal policy that either runs the server all the time or switches the server off when the system becomes empty and switches it on when the workload reaches or exceeds some threshold D.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.R. Artalejo, The D-policy for the M/G/1 queue length and optimality, Electronic Modelling 23(2) (2001) 35-43.
J.R. Artalejo, On the M/G/1 queue with D-policy, Appl. Math. Modeling 25 (2001) 1055-1069.
K.R. Balachandran, Control policies for a single server system, Managm. Sci. 19 (1973) 1013-1018.
K.R. Balachandran and H.C. Tijms, On the D-policy for the M/G/1 queueing system with removable server, Managm. Sci. 21 (1975) 1073-1076.
C.E. Bell, Caracterization and computation of optimal policies for operating an M/G/1 queueing system with removable server, Oper. Res. 19 (1971) 208-218.
O.J. Boxma, Note on a control problem of Balanchadran and Tijms, Managm. Sci. 22 (1976) 916-917.
E.V. Denardo, E.A. Feinberg and O. Kella, Stochastic monotonicity for stationary recurrence times of first passage heights, Ann. Appl. Probab. 7 (1997) 326-339.
E.B. Dynkin and A.A. Yushkevich, Controlled Markov Processes (Springer, New York, 1979).
A. Federgruen and K.C. So, Optimality of threshold policies in single-server queueing systems with server vacations, Adv. in Appl. Probab. 23 (1991) 388-405.
E.A. Feinberg, A generalization of 'expectation equals reciprocal of intensity' to non-stationary exponential distributions, J. Appl. Probab. 31 (1994) 262-267.
E.A. Feinberg, Continuous-time discounted jump-Markov decision processes: A discrete-event approach, Preprint, Department of Applied Mathematics and Statistics, State University of New York at Stony Brook (1998).
E.A. Feinberg, Constrained discounted semi-Markov decision processes, in: Markov Processes and Controlled Markov Chains, eds. J. Filar, S. Chen and H. Zhenting (Kluwer, Norwell, MA, 2002) pp. 231-242.
E.A. Feinberg, On additional information in sequential decision processes, Department of Applied Mathematics and Statistics, State University of New York at Stony Brook (2002).
E.A. Feinberg and D.J. Kim, Bicriterion optimization of an M/G/1 queue with a removable server, Probab. Engrg. Inform. Sci. 10 (1996) 57-73.
E.A. Feinberg and M.I. Reiman, Optimality of randomized trunk reservation, Probab. Engrg. Inform. Sci. 8 (1994) 463-489.
D.P. Heyman, Optimal operating policies for M/G/1 queueing systems, Oper. Res. 16 (1968) 362-382.
O. Kella, An exhaustive Lévy storage process with intermittent output, Stochastic Models 14(4) (1998) 979-992.
M.Yu. Kitayev, Semi-Markov and jump Markov controlled models: Average cost criterion, SIAM Theory Probab. Appl. 30 (1985) 272-288.
H.S. Lee and M.M. Srinivasan, Control policies for the M X /G/1 queueing system, Managm. Sci. 35 (1989) 708-721.
N.U. Prabhu, Stochastic Storage Processes: Queues, Insurance Risk, and Dams (Springer, New York, 1980).
M.L. Puterman, Markov Decision Processes (Wiley, New York, 1994).
S.M. Ross, Applied Probability Models with Optimization Applications (Holden-Day, San Francisco, CA, 1970).
M. Schäl, Average optimality in dynamic programming with general state space, Math. Oper. Res. 18 (1993) 163-172.
L.I. Senott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, New York, 1999).
L.I. Senott, Average reward optimization theory for denumerable state spaces, in: Handbook of Markov Decision Processes, eds. E.A. Feinberg and A. Schwartz (Kluwer, Boston, 2002) pp. 152-172.
M.J. Sobel, Optimal average-cost policy for a queue with start-up and shut-down costs, Oper. Res. 17 (1969) 145-162.
R. Strauch, Negative dynamic programming, Ann. Math. Statist. 37 (1966) 871-890.
H.C. Tijms, Optimal control of the workload in an M/G/1 queueing system with removable server, Math. Operationsforsch. Statist. 7 (1976) 933-943.
M. Yadin and P. Naor, Queueing systems with a removable service station, Oper. Res. 14 (1963) 393-405.
A.A. Yushkevich, On semi-Markov controlled models with average reward criterion, SIAM Theory Probab. Appl. 26 (1981) 796-803.
D.V. Widder, The Laplace Transform (Princeton Univ. Press, Princeton, 1946).
R.W. Wolff, Stochastic Modeling and the Theory of Queues (Prentice-Hall, Englewood Cliffs, NJ, 1989).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Feinberg, E.A., Kella, O. Optimality of D-Policies for an M/G/1 Queue with a Removable Server. Queueing Systems 42, 355–376 (2002). https://doi.org/10.1023/A:1020989221378
Issue Date:
DOI: https://doi.org/10.1023/A:1020989221378