The Slow Server Problem for Uninformed Customers

Authors:
Fabricio Bandeira Cabral
Affiliations:
Universidade Estadual do Rio Grande do Sul, Guaiba, Brazil 92500-000
Venue:
Queueing Systems: Theory and Applications
Year:
2005

Citing 1
Cited 3

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

Systems & Control Letters

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
On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers

Management Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we analyze systems that can be modelled by M 驴 M 驴 n queues with heterogeneous servers and non informed customers. We solve the balance equations. We present a threshold result for a system with an arbitrary number n of servers, i.e. we show that there is a value of arrival rate below which the slow server should not be used and above which it should be used. The structure of the slow server problem for uninformed costumers is investigated. Results for homogeneous systems are also provided in order to add insight into the structure of the problem.