Monotone Optimal Policies for a Transient Queueing Staffing Problem

Authors:
Michael C. Fu;Steven I. Marcus;I-Jeng Wang
Affiliations:
-;-;-
Venue:
Operations Research
Year:
2000

Citing 0
Cited 5

Optimal Pricing and Admission Control in a Queueing System with Periodically Varying Parameters

Queueing Systems: Theory and Applications
Monotonicity in Markov Reward and Decision Chains: Theory and Applications

Foundations and Trends® in Stochastic Systems
Performance Analysis of a Queue with Congestion-Based Staffing Policy

Management Science
Using control theory for analysis of reinforcement learning and optimal policy properties in grid-world problems

ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
Transient analysis of general queueing systems via simulation-based transfer function modeling

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.