Dynamic Control of N-Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic
Tóm tắt
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μ-type greedy policy is asymptotically optimal in many-server heavy traffic.
Từ khóa
Tài liệu tham khảo
Bertsekas D., 1992, Data Networks
Billingsley P., 1968, Convergence of Probability Measures
Buzacott J., 1993, Stochastic Models of Manufacturing Systems
Chung K. L., 2001, A Course in Probability Theory, 3
Garnett O., Mandelbaum A. An introduction to skills-based routing and its operational complexities. (2001) . Working notes, Technion, Haifa, Israel
Garnett O., 2002, Manufacturing Service Oper. Management, 48, 566
Tezcan T. State space collapse in many-server diffusion limits of parallel server systems and applications. (2006) . Ph.D. thesis, Georgia Institute of Technology, Atlanta