






















Abstract:This paper studies the problem of identifying the optimal server assignment policy in single-server queues with customer abandonment. We consider a system with Poisson arrivals and exponentially distributed patience times. We show that when service times follow either an Erlang-$K$ or a hyperexponential distribution and the decision maker can observe the phase of a customer's service time, the Shortest Remaining Expected Processing Time (SREPT) policy maximizes the long-run average throughput, independent of the abandonment rate.
From: Runhua Wu [view email]
[v1]
Thu, 25 Jun 2026 02:39:08 UTC (17 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。