期刊
OPERATIONS RESEARCH
卷 58, 期 1, 页码 94-110出版社
INFORMS
DOI: 10.1287/opre.1080.0668
关键词
-
资金
- National Science Foundation [CMMI-0727400, CNS-0718701]
- IBM
We consider a class of parallel server systems that are known as N-systems. In an N-system, there are two customer classes that are catered by servers in two pools. Servers in one of the pools are cross-trained and can serve customers from both classes, whereas all of the servers in the other pool can serve only one of the customer classes. A customer reneges from his queue if his waiting time in the queue exceeds his patience. Our objective is to minimize the total cost that includes a linear holding cost and a reneging cost. We prove that, when the service speed is pool dependent, but not class dependent, a c mu-type greedy policy is asymptotically optimal in many-server heavy traffic.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据