Abstract
We provide weak sufficient conditions for a full-service policy to be optimal in a queueing control problem in which the service rate is a dynamic decision variable. In our model there are service costs and holding costs and the objective is to minimize the expected total discounted cost over an infinite horizon. We begin with a semi-Markov decision model for a single-server queue with exponentially distributed inter-arrival and service times. Then we present a general model with weak probabilistic assumptions and demonstrate that the full-service policy minimizes both finite-horizon and infinite-horizon total discounted cost on each sample path.
Similar content being viewed by others
References
Bell C (1971) Characterization and computation of optimal policies for operating an M/G/1 queuing system with removable server. Oper Res 19:208–218
Lippman S (1975) Applying a new device in the optimization of exponential queuing systems. Oper Res 23:687–710
Puterman M (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York
Sobel M (1982) The optimality of full service policies. Oper Res 30:636–649
Stidham S (1972) L=λ W: a discounted analogue and a new proof. Oper Res 20:1115–1126
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Stidham, S. On the optimality of a full-service policy for a queueing system with discounted costs. Math Meth Oper Res 62, 485–497 (2005). https://doi.org/10.1007/s00186-005-0040-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-005-0040-6