Title :
Switching on and off the full capacity of an M/M/∞ queue
Author :
Feinberg, Eugene ; Zhang, Xiaoxuan
Author_Institution :
Dept. of Appl. Math. & Stat., Stony Brook Univ., Stony Brook, NY, USA
Abstract :
This paper studies optimal switching on and off the full capacity of an M/M/∞ queue with holding, running and switching costs. The main result is that an average-cost optimal policy either always runs the system or is defined by two thresholds M and N, such that the system is switched on at arrival epochs when the number of customers in the system accumulates to N and it is switched off at departured epoch when the number of customers in the system decreases to M.
Keywords :
client-server systems; cost optimal control; discrete time systems; queueing theory; stochastic processes; time-varying systems; M/M/∞ queue; Poisson process; average-cost optimal policy; customer arrival; discrete time problem; holding cost; optimal switching; running cost; switching cost; Equations; Exponential distribution; History; Mathematical model; Servers; Software; Switches;
Conference_Titel :
Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
978-1-61284-800-6
Electronic_ISBN :
0743-1546
DOI :
10.1109/CDC.2011.6161369
