On the optimal control of two queues with server setup times and its analysis
SIAM Journal on Computing
Separable routing: a scheme for state-dependent routing of circuit switched telephone traffic
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Queueing Systems: Theory and Applications - Polling models
Queueing analysis of a threshold based priority scheme for ATM networks
IEEE/ACM Transactions on Networking (TON)
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
On the value function of a priority queue with an application to a controlled polling model
Queueing Systems: Theory and Applications
Dynamic Scheduling of a Two-Class Queue with Setups
Operations Research
THRESHOLD POLICIES FOR A SINGLE-SERVER QUEUING NETWORK
Probability in the Engineering and Informational Sciences
An Explicit Solution for the Value Function of a Priority Queue
Queueing Systems: Theory and Applications
When does the cµ rule apply to finite-population queueing systems?
Operations Research Letters
On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the long-run expected average cost of holding units and switching actions of the server, and the bias vector.