Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times

by: Esther Frostig, Benny Levikson

Operations Research, Vol. 47, No. 3. (1999), pp. 438-444.

View FullText article

JSTOR

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

zhangzhidong, QUEUE (group)

Find related articles with these CiteULike tags

control

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 cost. 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.

@article{citeulike:876447, 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 cost. 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.}, author = {Frostig, Esther and Levikson, Benny }, citeulike-article-id = {876447}, journal = {Operations Research}, keywords = {control}, number = {3}, pages = {438--444}, posted-at = {2006-09-28 18:35:19}, priority = {2}, title = {Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times}, url = {http://www.jstor.org/stable/223113}, volume = {47}, year = {1999} }

RIS record

TY - JOUR ID - citeulike:876447 L3 - citeulike-article-id:876447 TI - Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times JF - Operations Research VL - 47 IS - 3 SP - 438 EP - 444 N2 - 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 cost. 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. KW - control AU - Frostig, Esther AU - Levikson, Benny PY - 1999/// UR - http://www.jstor.org/stable/223113 ER -

RIS BibTeX