Strategic joining and information disclosing in Markovian queues with an unreliable server and working vacations

被引:11
|
作者
Zhang, Y. [1 ]
Wang, Jinting [2 ]
机构
[1] Univ Sci & Technol Beijing, Sch Econ & Management, Beijing, Peoples R China
[2] Cent Univ Finance & Econ, Sch Management Sci & Engn, Dept Management Sci, Beijing 100081, Peoples R China
来源
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Queueing; working vacation; breakdown; equilibrium strategies; system throughput; M/G/1 RETRIAL QUEUE; SOCIAL OPTIMIZATION; M/M/1; QUEUES; BEHAVIOR;
D O I
10.1080/16843703.2020.1809062
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We study a queueing system of an unreliable server providing services to customers with two different service rates. When the system is empty of customers, the server takes a vacation and provides a low service rate. Once the vacation is completed, the server is resumed to serve customers, if any, at a higher service rate, or takes another vacation if the server found an empty system. The server is subject to random breakdowns when serving customers and if failed, it enters a repair stage. Under different system information levels, we investigate customers' equilibrium strategies and follow-up system measures. Numerical comparisons among different information levels reveal that when the traffic load is large enough, the service provider (SP) prefers to disclose the server's status and queue length information to customers to maximize the system throughput. While when the traffic load is small enough, there exist two cases with regard to the failure rate: (i) If the failure rate is smaller than a certain threshold, the SP tends to conceal the system information. (ii) If the failure rate is greater than the threshold, revealing the information is helpful to maximize the system throughput.
引用
收藏
页码:298 / 325
页数:28
相关论文
共 30 条