Wait-Time-Based Control of Single-Server Queues

32 Pages Posted: 12 Nov 2024 Last revised: 12 Nov 2024

See all articles by Chen-An (Andy) Lin

Chen-An (Andy) Lin

Purdue University - Daniels School of Business

Kevin Shang

Duke University

Peng Sun

Duke University - Fuqua School of Business

Date Written: October 14, 2024

Abstract

In this paper, we propose a dynamic control strategy that specifies the service time and admission probability to manage a queuing system in which each arriving customer can decide whether or not to join the queue. We present the general modeling framework and optimality conditions in terms of a Hamilton-Jacobian-Bellman equation to maximize a long-run average reward rate over an infinite horizon. To demonstrate its applicability, we first cast the model of Lin et al. (2023) into this framework. We further consider a make-to-order system in which customers have private information on their wait time sensitivities. We characterize the structure of the optimal mechanism and confirm the intuition that when the system congestion increases, the provider should only admit more patient customers while offering shorter service times.

Keywords: Queueing System, Optimal Control, Mechanism Design, HJB Equations, Wait-time

Suggested Citation

Lin, Chen-An and Shang, Kevin and Sun, Peng, Wait-Time-Based Control of Single-Server Queues (October 14, 2024). Available at SSRN: https://ssrn.com/abstract=4986993 or http://dx.doi.org/10.2139/ssrn.4986993

Chen-An Lin (Contact Author)

Purdue University - Daniels School of Business ( email )

403 Mitch Daniels Blvd
West Lafayette, IN 47907

Kevin Shang

Duke University ( email )

100 Fuqua Drive
Durham, NC 27708-0204
United States

Peng Sun

Duke University - Fuqua School of Business ( email )

Box 90120
Durham, NC 27708-0120
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
24
Abstract Views
74
PlumX Metrics