Optimal routing of customers to two parallel heterogeneous servers: The case of IHR service times

Optimal routing of customers to two parallel heterogeneous servers: The case of IHR service times

0.00 Avg rating0 Votes
Article ID: iaor20011066
Country: United States
Volume: 47
Issue: 3
Start Page Number: 438
End Page Number: 444
Publication Date: May 1999
Journal: Operations Research
Authors: ,
Keywords: programming: dynamic, queues: applications
Abstract:

We consider here the optimal routing of customers, arriving to a system consisting of two heterogeneous parallel servers. The service times of the two servers have an increasing hazard rate. The arrival process is a general renewal process. The cost of holding x customers in the system per time unit is a nondecreasing and convex function. The objective is to minimize the expected discounted holding costs. We show some monotonicity properties of the optimal policy. Then we show that the optimal policy routes an arriving customer to the fastest server whenever this server has the lowest workload.

Reviews

Required fields are marked *. Your email address will not be published.