Approximations for Chat Service Systems Using Many-Server Diffusion Limits

Abstract

We study a queueing model of customer service chat systems. A unique feature of these queueing systems is that a single agent can serve multiple customers simultaneously. We prove the convergence of the queueing process to different diffusion processes in a many-server heavy-traffic regime in three different cases. Using this result, we are able to offer approximations for the steady-state performance measures such as the number of customers in the system, the abandonment probability, and the sojourn time of a customer. Our numerical experiments show that proposed approximations are accurate in various cases.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 13 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.