论文信息 - Monotone Optimal Policies for a Transient Queueing Staffing Problem

Monotone Optimal Policies for a Transient Queueing Staffing Problem

We consider the problem of determining the optimal policy for staffing a queueing system over multiple periods, using a model that takes into account transient queueing effects. Formulating the problem in a dynamic programming setting, we show that the optimal policy follows a monotone optimal control by establishing the submodularity of the objective function with respect to the staffing level and initial queue size in a period. In particular, this requires proving that the system occupancy in aG/M/s queue is submodular in the number of servers and initial system occupancy.

Michael C. Fu | I-Jeng Wang | Steven I. Marcus

[1] Daniel P. Heyman,et al. Stochastic models in operations research , 1982 .

[2] D. Sonderman. Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers , 1979, Advances in Applied Probability.

[3] Sheldon M. Ross,et al. Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[4] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[5] Ward Whitt,et al. Comparison methods for queues and other stochastic models , 1986 .

[6] Arjang A. Assad,et al. A Lower Bounding Result for the Optimal Policy in an Adaptive Staffing Problem , 1998 .

[7] N. L. Lawrie,et al. Comparison Methods for Queues and Other Stochastic Models , 1984 .

[8] D. Yao,et al. Stochastic monotonicity in general queueing networks , 1989, Journal of Applied Probability.

[9] Moshe Shaked,et al. Stochastic orders and their applications , 1994 .

[10] S. Fotopoulos. Stochastic modeling and analysis of manufacturing systems , 1996 .

[11] David D. Yao,et al. Stochastic Convexity and Stochastic Majorization , 1994 .

[12] 李幼升,et al. Ph , 1989 .