Abstract

We consider the problem ofserver scheduling in a multiclass many-server queueing system with abandonment.For the purpose of minimizing the long-run average queue length costs andabandon penalties, we propose three scheduling policies to cope with any generalcost functions and general patience time distributions. First, we introduce thetarget-allocation policy, which assigns higher priority to customer classeswith larger deviation from the desired allocation of the service capacity, andprove its optimality for any general queue length cost functions and patiencetime distributions. The Gcμ/h rule, which extends the well-known Gcμ rule bytaking abandonment into account, is shown to be optimal for the case of convexqueue length costs and nonincreasing hazard rates of patience. For the case ofconcave queue length costs but nondecreasing hazard rates of patience, it isoptimal to apply a fixed priority policy, and a knapsack-like problem isdeveloped to determine the optimal priority order efficiently. As a motivatingexample of the operations of emergency departments, a hybrid of the Gcμ/h ruleand the fixed priority policy is suggested to reduce crowding and queueabandonment. Numerical experiments show that this hybrid policy performssatisfactorily.

Time

3月12日（周二）14:00-15:00

Speaker

Dr. Zhenghua Long iscurrently a Postdoc Scholar in the Department of Industrial Engineering andDecision Analytics at the Hong Kong University of Science and Technology underthe supervision of Professor Jiheng Zhang. He was a research fellow in theFaculty of Industrial Engineering and Management at Technion-Israel Instituteof Technology. He received his PhD degree in Operations Research from HKUST in2015. Prior to that, he graduated from Department of Mathematics at NanjingUniversity in 2010. His research interests lie in asymptotic analysis andoptimal control of queueing systems and their applications in manufacturing andservices.

Venue

信息管理与工程学院102室

上海财经大学（第三教学楼西侧）

上海市杨浦区武东路100号