On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System
Queueing Systems: Theory and Applications
Optimal Control Of A Make-To-Stock System With Adjustable Service Rate
Probability in the Engineering and Informational Sciences
Dynamic power control in a fading downlink channel subject to an energy constraint
Queueing Systems: Theory and Applications
Operations Systems with Discretionary Task Completion
Management Science
Revenue Management of a Make-to-Stock Queue
Operations Research
Dynamic Control of a Multiclass Queue with Thin Arrival Streams
Operations Research
Optimal buffer size for a stochastic processing network in heavy traffic
Queueing Systems: Theory and Applications
QDSL: a queuing model for systems with differential service levels
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal sleep patterns for serving delay-tolerant jobs
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Optimality, fairness, and robustness in speed scaling designs
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Admission control for a multi-server queue with abandonment
Queueing Systems: Theory and Applications
Distributive stochastic learning for delay-optimal OFDMA power and subband allocation
IEEE Transactions on Signal Processing
Dynamic admission and service rate control of a queue
Queueing Systems: Theory and Applications
Asymptotically Optimal Controls for Time-Inhomogeneous Networks
SIAM Journal on Control and Optimization
An Econometric Analysis of Patient Flows in the Cardiac Intensive Care Unit
Manufacturing & Service Operations Management
Power-aware speed scaling in processor sharing systems: Optimality and robustness
Performance Evaluation
Diagnostic Accuracy Under Congestion
Management Science
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
Energy-efficient scheduling in multi-core servers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal arrival rate and service rate control of multi-server queues
Queueing Systems: Theory and Applications
Attention allocation for decision making queues
Automatica (Journal of IFAC)
| Hi-index | 0.01 |
We consider a single-server queue with Poisson arrivals, where holding costs are continuously incurred as a nondecreasing function of the queue length. The queue length evolves as a birth-and-death process with constant arrival rate ? = 1 and with state-dependent service rates 脗µ nthat can be chosen from a fixed subset A of [0, 8). Finally, there is a nondecreasing cost-of-effort functionc(脗·) on A, and service costs are incurred at ratec(脗µ n ) when the queue length isn. The objective is to minimize average cost per time unit over an infinite planning horizon. The standard optimality equation of average-cost dynamic programming allows one to write out the optimal service rates in terms of the minimum achievable average costz*. Here we present a method for computingz* that is so fast and so transparent it may be reasonably described as an explicit solution for the problem of service rate control. The optimal service rates are nondecreasing as a function of queue length and are bounded if the holding cost function is bounded. From a managerial standpoint it is natural to comparez*, the minimum average cost achievable with state-dependent service rates, against the minimum average cost achievable with a single fixed service rate. The difference between those two minima represents the economic value of a responsive service mechanism, and numerical examples are presented that show it can be substantial.