Abstract
We consider congestion control in a nonstationary queueing system. Assuming that the arrival and service rates are bounded, periodic functions of time, a Markov decision process (MDP) formulation is developed. We show under the infinite horizon discounted and average reward optimality criteria, for each fixed time, optimal pricing and admission control strategies are nondecreasing in the number of customers in the system. This extends stationary results to the nonstationary setting. Despite this result, the problem still seems intractable. We propose an easily implementable pointwise stationary approximation (PSA) to approximate the optimal policies, suggest a heuristic to improve the implementation of the PSA and verify its usefulness via a numerical study.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y. Feng and B. Xiao, Optimal policies of yield management with multiple predetermined prices, Oper. Res. 48(2) (2000) 332–343.
M.C. Fu, S.I. Marcus and I. Wang, Monotone optimal policies for a transient queueing staffing problem, Oper. Res. 48(2) (2000) 327–331.
L.V. Green and P.J. Kolesar, On the accuracy of the simple peak hour approximation for Markovian queues, Managm. Sci. 41(8) (1995) 1353–1370.
L.V. Green and P.J. Kolesar, The lagged psa for estimating peak congestion in multiserver Markovian queues with periodic arrival rates, Managm. Sci. 43(1) (1997) 80–87.
O. Hernández-Lerma and J.B. Lasserre, Discrete-Time Markov Control Processes: Basic Optimality Criteria, Applications of Mathematics: StochasticModelling and Applied Probability (Springer, New York, 1996).
D.P. Heyman, Optimal operating policies for M/G/1 queueing systems, Oper. Res. 16 (1968) 362–382.
M.E. Lewis, H. Ayhan and R.D. Foley, Bias optimal admission control policies for a multi-class nonstationary queueing system, J. Appl. Probab. 39(1) (2002) 20–37.
S.A. Lippman, Applying a new device in the optimization of exponential queueing systems, Oper. Res. 23(4) (1975) 687–712.
S.A. Lippman and S.M. Ross, The streetwalker's dilemma: A job shop model, SIAM J. Appl. Math. 20(3) (1971) 336–342.
S.A. Lippman, J. Stidham and Shaler, Individual versus social optimization in exponential congestion systems, Oper. Res. 25(2) (1977) 233–247.
D.W. Low, Optimal dynamic pricing policies for an M/M/s queue, Oper. Res. 22(3) (1974) 545–561.
W.A. Massey and W. Whitt, Stationary-process approximations for the nonstationary Erlang loss model, Oper. Res. 44(6) (1996) 976–983.
W.A. Massey and W. Whitt, Peak congestion in multi-server service systems with slowly varying arrival rates, Oper. Res. 25 (1997) 157–172.
S.P. Meyn and R.L. Tweedie, Markov Chains and Stochastic Stability(Springer, New York, 1993).
B. Miller, A queueing reward system with several customer classes, Managm. Sci. 16(3) (1969) 234–245.
I.C. Paschalidis and J.N. Tsitsiklis, Congestion-dependent pricing of on-line Internet services, in: Proc. of the 38th Conf. on Decision and Control, Phoenix, AZ (December 1999).
M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley Series in Probability and Mathematical Statistics (Wiley, New York, 1994).
M. Yadin and P. Naor, Queueing systems with a removable service station, Oper. Res. Quart. 14(4) (1963) 393–405.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yoon, S., Lewis, M.E. Optimal Pricing and Admission Control in a Queueing System with Periodically Varying Parameters. Queueing Systems 47, 177–199 (2004). https://doi.org/10.1023/B:QUES.0000035313.20223.3f
Issue Date:
DOI: https://doi.org/10.1023/B:QUES.0000035313.20223.3f