On the incomplete results for the heterogeneous server problem

Authors:
Francis Véricourt;Yong-Pin Zhou
Affiliations:
Fuqua School of Business, Duke University, Durham, USA 27708;Zhou Business School, University of Washington, Seattle, USA 98195-3200
Venue:
Queueing Systems: Theory and Applications
Year:
2006

Citing 4
Cited 4

A simple proof of the optimality of a threshold policy in a two-server queueing system

Systems & Control Letters
Monotone Control of Queueing Systems with Heterogeneous Servers

Queueing Systems: Theory and Applications
Control of multiple exponential servers with application to computer systems

Control of multiple exponential servers with application to computer systems
Dynamic Routing in Large-Scale Service Systems with Heterogeneous Servers

Queueing Systems: Theory and Applications

Monotonicity in Markov Reward and Decision Chains: Theory and Applications

Foundations and Trends® in Stochastic Systems
On the slow server problem

Automation and Remote Control
Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems

Operations Research
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers

Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this article, we show that the arguments in Rykov [9] on the optimality of a threshold routing policy when there are more than two heterogeneous servers are incomplete.