Professor Xia Li of Our School Published Paper as the First Author on Production and Operations Management
Professor Xia Li has conducted continuous and in-depth research on the dynamic control problem of queuing system. Studying this problem from a new perspective of sensitivity optimization theory can provide a new perspective different from the classical dynamic programming method and obtain new research progress. Professor Xia Li has published a number of papers as the first-author on such issues in the past decade, including Production and Operations Management (1 paper) - a top journal in the field of management, IEEE Transactions on Automatic Control (5 papers) - a top journal in the field of control, and European Journal of Operational Research (3 papers) –an authoritative journal in the field of operational research, and has completed 2 projects of National Natural Science Foundation of China (Theory and Application of Queuing System Optimization Based on Fairness Index - 61573206; Queuing System Performance Optimization Based on Differential Sensitivity Information - 61203039) and a number of invention patents which were applied to Huawei's router scheduling algorithm and other enterprise cooperation projects, forming a relatively complete research system.
Professor Xia Li published a paper titled "A c/μ-Rule for Job Assignment in Heterogeneous Group-Server Queues" as the first author in Production and Operations Management (hereinafter, POM) – a top journal in the field of management, in March 2022 (Vol. 31 , Issue 3, March 2022, Pages 1191-1215), as the deepening and continuation of the above series of research work. The paper gives the c/μ rule for the task assignment problem of group-server queue system and proves the optimality. This rule can reduce the complexity of the optimization problem from exponential to linear, and the optimal strategy has a threshold form, which is easy to deploy and implement in practical engineering. Deployment implementation. The group-server queue optimal scheduling rule c/μ-rule proposed in this paper can be regarded as a sister version of the polling queue optimal scheduling rule cμ-rule, which is the classic conclusion of queuing theory. The two rules have the characteristics of simple form and complementary symmetry.


