Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Wu, Runhua, Ayhan, Hayriye, Down, Douglas G.
Institutions: Georgia Institute of Technology, McMaster University
Subfield: Management Information Systems
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W7166170000
Cites:
Cited by:
Related to: