Convexity Results for the Erlang Delay and Loss Formulae When the Server Utilization Is Held Constant

• 成果类型: Article
• 署名作者: Harel, Arie
• 署名单位: City University of New York (CUNY) System; Baruch College (CUNY)
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.1110.0957
• 发表日期: 2011
• 页码: 1420-1426
• 关键词: systems; queues; bounds

摘要

This paper proves a long-standing conjecture regarding the optimal design of the M/M/s queue. The classical Erlang delay formula is shown to be a convex function of the number of servers when the server utilization is held constant. This means that when the server utilization is held constant, the marginal decrease in the probability that all servers are busy in the M/M/s queue brought about by the addition of two extra servers is always less than twice the decrease brought about by the addition of one extra server. As a consequence, a method of marginal analysis yields the optimal number of servers that minimize the waiting and service costs when the server utilization is held constant. In addition, it is shown that the expected number of customers in the queue and in the system, as well as the expected waiting time and sojourn in the M/M/s queue, are convex in the number of servers when the server utilization is held constant. These results are useful in design studies involving capacity planning in service operations. The classical Erlang loss formula is also shown to be a convex function of the number of servers when the server utilization is held constant.