Optimal control of an M/H k /1 queueing system with a removable server

2003 ◽  
Vol 57 (2) ◽  
pp. 255-262 ◽  
Author(s):  
Kuo-Hsiung Wang ◽  
Kuo-Liang Yen
Keyword(s):  
Optimal Control ◽  
Queueing System ◽  
Removable Server

On the optimal control of a single-server queueing system: Reply

1978 ◽  
Vol 26 (3) ◽  
pp. 463-464 ◽  
Author(s):  
C. H. Scott ◽  
T. R. Jefferson
Keyword(s):  
Optimal Control ◽  
Queueing System ◽  
Single Server

On the optimal control of loss probability and profit in a GI/C-BMSP/1/N queueing system

OPSEARCH ◽  
2019 ◽  
Vol 57 (1) ◽  
pp. 144-162
Author(s):  
Abhijit Datta Banik ◽  
Souvik Ghosh ◽  
M. L. Chaudhry
Keyword(s):  
Optimal Control ◽  
Queueing System ◽  
Loss Probability

OPTIMAL CONTROL POLICIES FOR AN M/M/1 QUEUE WITH A REMOVABLE SERVER AND DYNAMIC SERVICE RATES

2019 ◽  
pp. 1-21
Author(s):  
Pamela Badian-Pessot ◽  
Mark E. Lewis ◽  
Douglas G. Down
Keyword(s):  
Optimal Control ◽  
Rate Control ◽  
Optimal Policy ◽  
Numerical Experiments ◽  
Service Rate ◽  
Warm Up ◽  
Cost Criterion ◽  
Optimal Service ◽  
Removable Server ◽  
Service Rates

AbstractWe consider an M/M/1 queue with a removable server that dynamically chooses its service rate from a set of finitely many rates. If the server is off, the system must warm up for a random, exponentially distributed amount of time, before it can begin processing jobs. We show under the average cost criterion, that work conserving policies are optimal. We then demonstrate the optimal policy can be characterized by a threshold for turning on the server and the optimal service rate increases monotonically with the number in system. Finally, we present some numerical experiments to provide insights into the practicality of having both a removable server and service rate control.

Sign in / Sign up

Export Citation Format

Share Document