On queue-length information when customers travel to a queue

被引:0
|
作者
Hassin R. [1 ]
Roet-Green R. [2 ]
机构
[1] Department of Statistics and Operations Research, School of Mathematical Sciences, Tel Aviv University, Tel Aviv
[2] Simon Business School, University of Rochester, Rochester, 14627, NY
来源
基金
以色列科学基金会;
关键词
Delay cost; Observable queue; Service systems; Strategic customers; Symmetric equilibrium; Unobservable queue;
D O I
10.1287/MSOM.2020.0909
中图分类号
O211 [概率论(几率论、或然率论)];
学科分类号
摘要
Problem definition:We consider a service system in which customers must travel to the queue to be served. In our base model, customers observe the queue length and then decide whether to travel. We also consider alternative information models and investigate how the availability of queue-length information affects customer-equilibrium strategies, throughput, and social welfare. Academic/practical relevance: A common assumption in queueing models is that once a customer decides to join the queue, joining is instantaneous. This assumption does not fit real-life settings, where customers possess online information about the current wait time at the service, but while traveling to the service, its queue length may change. Motivated by this realistic setting, we study how queue-length information prior to traveling affects customers' decision to travel. Methodology: We prove that a symmetric equilibriumexists in our base model.We perform the calculation numerically as a result of the model complexity, which is due to the fact that the arrival rate to the traveling queue depends on the current state of the service queue, and vice versa. The alternative models are tractable, and we present their analytical solution. Results:When customers can observe the service-queue length prior to traveling, their probability of traveling is monotonically nonincreasing with the observed queue length.We find that customersmay adopt a generalized mixed-threshold equilibrium strategy: Travel when observing short queue lengths, avoid traveling when observing long queue lengths, andmix between traveling and not traveling when observing intermediate queue lengths, with a decreasing probability of traveling. Managerial implications: Our results imply that when system congestion is high, the provider can increase throughput by disclosing the queue-length information, whereas at lowcongestion, the provider benefits fromconcealing the information.With respect to social welfare, queue-length information prior to departure is beneficial when congestion is at intermediate to high levels and yields the same social welfare otherwise. © 2020 INFORMS.
引用
收藏
页码:989 / 1004
页数:15
相关论文
共 50 条
  • [21] Study on the Queue-Length Distribution in Geo/G(MWV)/1/N Queue with Working Vacations
    Luo, Chuanyi
    Li, Jiangyi
    Tang, Yinghui
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2015, 2015
  • [22] Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers
    Sunggon Kim
    Journal of the Korean Statistical Society, 2014, 43 : 105 - 118
  • [24] Queue-length distributions for two-stage CBR multiplexing
    Tellabs Operations, Inc, Mishawaka, United States
    IEEE ATM Workshop Proc, (378-384):
  • [25] Queue-length distributions for multi-priority queueing systems
    Daigle, JN
    Roughan, M
    IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW, 1999, : 641 - 648
  • [26] Transient and equilibrium distributions of the queue-length for M/G/1 queue with delayed N-policy
    School of Mathematics and Software Science, Sichuan Normal University, Chengdu 610066, China
    Xitong Gongcheng Lilum yu Shijian, 2007, 11 (130-134):
  • [27] Queue-length distributions for two-stage CBR multiplexing
    Hrabik, TJ
    Kenney, JB
    1998 IEEE ATM WORKSHOP PROCEEDINGS: MEETING THE CHALLENGES OF DEPLOYING THE GLOBAL BROADBAND NETWORK INFRASTRUCTURE, 1998, : 378 - 384
  • [28] Queue-length balance equations in multiclass multiserver queues and their generalizations
    Marko A. A. Boon
    Onno J. Boxma
    Offer Kella
    Masakiyo Miyazawa
    Queueing Systems, 2017, 86 : 277 - 299
  • [29] Queue-length balance equations in multiclass multiserver queues and their generalizations
    Boon, Marko A. A.
    Boxma, Onno J.
    Kella, Offer
    Miyazawa, Masakiyo
    QUEUEING SYSTEMS, 2017, 86 (3-4) : 277 - 299
  • [30] Computing queue-length distributions for power-law queues
    Roughan, M
    Veitch, D
    Rumsewicz, M
    IEEE INFOCOM '98 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS. 1-3: GATEWAY TO THE 21ST CENTURY, 1998, : 356 - 363