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

Esther Frostig and Benny Levikson
Additional contact information
Esther Frostig: University of Haifa, Haifa, Israel
Benny Levikson: University of Haifa, Haifa, Israel

Operations Research, 1999, vol. 47, issue 3, 438-444

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.

Keywords: queues; optimization; optimal routing; dynamic programming/optimal control; semi-Markov (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.3.438 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:47:y:1999:i:3:p:438-444

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().