Optimal control of flexible servers in two tandem queues with operating costs
Probability in the Engineering and Informational Sciences
Maximizing the throughput of tandem lines with flexible failure-prone servers and finite buffers
Probability in the Engineering and Informational Sciences
Dynamic scheduling for heterogeneous Desktop Grids
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Dynamic scheduling for heterogeneous Desktop Grids
Journal of Parallel and Distributed Computing
Queueing Systems: Theory and Applications
Dynamic server allocation for unstable queueing networks with flexible servers
Queueing Systems: Theory and Applications
Flexible servers in tandem lines with setup costs
Queueing Systems: Theory and Applications
Dynamic control of a flexible server in an assembly-type queue with setup costs
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival and service times are independent and identically distributed, that routing is probabilistic, and that the failure state of the system can be described by a Markov process that is independent of the other system dynamics. We find that the maximal capacity is tightly bounded by the solution of a linear programming problem and that the solution of this problem can be used to construct timed, generalized round-robin policies that approach the maximal capacity arbitrarily closely. We then give a series of structural results for our policies, including identifying when server flexibility can completely compensate for failures and when the implementation of our policies can be simplified. We conclude with a numerical example that illustrates some of the developed insights.