Asymptotic Analysis of Service Systems with Congestion-Sensitive Customers

Asymptotic Analysis of Service Systems with Congestion-Sensitive Customers

by John Jia-Hao Yao

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
Many systems in services, manufacturing, and technology, feature users or customers sharing a limited number of resources, and which suffer some form of congestion when the number of users exceeds the number of resources. In such settings, queueing models are a common tool for describing the dynamics of the system and quantifying the congestion that results from the aggregated effects of individuals joining and leaving the system. Additionally, the customers themselves may be sensitive to congestion and react to the performance of the system, creating feedback and interaction between individual customer behavior and aggregate system dynamics.This dissertation focuses on the modeling and performance of service systems with congestion-sensitive customers using large-scale asymptotic analyses of queueing models. This work extends the theoretical literature on congestion-sensitive customers in queues in the settings of service differentiation and observational learning and abandonment. Chapter 2 considers the problem of a service provider facing a heterogeneous market of customers who differ based on their value for service and delay sensitivity. The service provider seeks to find the revenue maximizing level of service differentiation (offering different price-delay combinations). We show that the optimal policy places the system in heavy traffic, but at substantially different levels of congestion depending on the degree of service differentiation. Moreover, in a differentiated offering, the level of congestion will vary substantially between service classes. Chapter 3 presents a new model of customer abandonment in which congestion-sensitive customers observe the queue length, but do not know the service rate. Instead, they join the queue and observe their progress in order to estimate their wait times and make abandonment decisions. We show that an overloaded queue with observational learning and abandonment stabilizes at a queue length whose scale depends on the tail of the service time distribution. Methodologically, our asymptotic approach leverages stochastic limit theory to provide simple and intuitive results for optimizing or characterizing system performance. In particular, we use the analysis of deterministic fluid-type queues to provide a first-order characterization of the stochastic system dynamics, which is demonstrated by the convergence of the stochastic system to the fluid model. This also allows us to crisply illustrate and quantify the relative contributions of system or customer characteristics to overall system performance.

Discuss Asymptotic Analysis of Service Systems with Congestion-Sensitive Customers with other readers

Join or start a book club for Asymptotic Analysis of Service Systems with Congestion-Sensitive Customers on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Asymptotic Analysis of Service Systems with Congestion-Sensitive Customers?

Sign up free on Readfeed, then browse public clubs or start your own club with Asymptotic Analysis of Service Systems with Congestion-Sensitive Customers as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Asymptotic Analysis of Service Systems with Congestion-Sensitive Customers with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Asymptotic Analysis of Service Systems with Congestion-Sensitive Customers with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.