Service Rate Control in Queues with Abandonments

We consider a Markovian single server queue with impatient customers. There is a customer abandonment cost and a holding cost for customers in the system. We consider two versions of the problem. In the first version, customers pay a reward at the time of arrival whereas in the second version, reward is received at the time of service completion. Service rate attains values in a compact set and there is a cost associated with each service rate. Under these assumptions, our objective is to characterize the service rate policy that maximizes the infinite-horizon discounted reward and the long-run average reward. We show that for systems with an infinite buffer, the optimal service rate policy is monotone. However, the optimal policy is not necessarily monotone when capacity is finite. Furthermore, we prove that the set of possible optimal actions can be reduced to the lower boundary of the convex hull of the action space and develop an efficient policy iteration algorithm. Finally, we show that the optimal service rate converges as the state goes to infinity which allows us to truncate the state space to numerically compute the optimal service rate when system has infinite buffer space.

• Publication year

  2025

• Venue

  Unknown venue

• Publication date

  2025-11-11

• Fields of study

  Mathematics

• Identifiers
  arXiv 2511.08523
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Discounted cost exponential semi-Markov decision processes with unbounded transition rates: a service rate control problem with impatient customers

  2024cited by this paper
• Adaptive service rate control of an M/M/1 queue with server breakdowns

  2024cited by this paper
• Event-based optimization of service rate control in retrial queues

  2022cited by this paper
• OPTIMAL CONTROL POLICIES FOR AN M/M/1 QUEUE WITH A REMOVABLE SERVER AND DYNAMIC SERVICE RATES

  2019cited by this paper
• Critical Care Capacity Management: Understanding the Role of a Step Down Unit

  2018cited by this paper
• Threshold-Based Allocation Policies for Inventory Management of Red Blood Cells

  2017cited by this paper
• Waiting Patiently: An Empirical Study of Queue Abandonment in an Emergency Department

  2015cited by this paper
• Queuing Time Decision Model with the Consideration on Call Center Customer Abandonment Behavior

  2014cited by this paper
• Dynamic service rate control for a single‐server queue with Markov‐modulated arrivals

  2013influential reference
• Optimal arrival rate and service rate control of multi-server queues

  2013cited by this paper
• Dynamic admission and service rate control of a queue

  2010cited by this paper
• Exact finite approximations of average-cost countable Markov decision processes

  2007influential reference
• Dynamic Control of an M/M/1 Service System with Adjustable Arrival and Service Rates

  2006cited by this paper
• A survey of recent results on continuous-time Markov decision processes

  2006influential reference
• Dynamic Control of a Queue with Adjustable Service Rate

  2001influential reference
• Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs

  1989influential reference
• Optimal control of service rates in networks of queues

  1987cited by this paper
• Optimal service-rate control of M/G/1 queueing systems using phase methods

  1983cited by this paper
• Optimal control of random walks, birth and death processes, and queues

  1981cited by this paper
• Optimal Control of a Maintenance System with Variable Service Rates

  1974cited by this paper
• Optimal Control of a Service Facility with Variable Exponential Service Times and Constant Arrival Rate

  1972influential reference

• No citing papers are available for this paper.