Comparison of Gatekeeping and Non-gatekeeping Designs in a Service System with Delay-sensitive Customers

被引:3
|
作者
Zhou, Wenhui [1 ]
Li, Xiuzhang [1 ]
Qian, Qu [2 ]
机构
[1] South China Univ Technol, Sch Business Adm, Guangzhou 510641, Peoples R China
[2] Singapore Univ Social Sci, Sch Business, Singapore 599494, Singapore
基金
中国国家自然科学基金;
关键词
Customer delay sensitivity; gatekeeper; service capacity; cure fraction; total social cost;
D O I
10.1007/s11518-021-5481-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper is motivated by a concern in China's current medical practice in which patients can bypass the primary care and seek secondary care directly. We employ a queueing approach to examine two settings, i.e. the gatekeeping and non-gatekeeping settings, in a service system consisting of two types of service provider - one with basic skills (C-H), e.g. community hospital, and the other with advanced skills (AAA-H), e.g. specialist hospital. Customers are heterogeneous with respect to service requirement. The C-H can only serve customers with a complexity level of service requirement lower than the cure threshold, while the AAA-H can serve all customers. We aim to analyze the social planner's capacity decision for the C-H in both settings and assess the relative merit of each setting with respect to total social welfare, i.e. the sum of customer benefits net of customer delay costs and service providers' operating costs. Our findings show that when the C-H's capacity is exogenous, the gatekeeper setting is preferable if the capacity of the C-H is in the intermediate range because customers' self-selection behavior gives rise to negative externality. When the C-H's capacity is optimized by the social planner, the non-gatekeeping setting is preferable if the capacity of the AAA-H is large or the cure threshold is high, because customers' self-selection behavior as well as the investment in the C-H's capacity can result in a better distribution of demand among the two service providers. The gatekeeping setting is preferable if the cure threshold is low because it is economical for the social planner to invest in a large capacity in the C-H to serve all customers. We also show numerically the conditions under which the two settings can achieve the first-best solution.
引用
收藏
页码:125 / 150
页数:26
相关论文
共 50 条
  • [1] Comparison of Gatekeeping and Non-gatekeeping Designs in a Service System with Delay-sensitive Customers
    Wenhui Zhou
    Xiuzhang Li
    Qu Qian
    [J]. Journal of Systems Science and Systems Engineering, 2021, 30 : 125 - 150
  • [2] Optimal pricing in a service-inventory system with delay-sensitive customers and lost sales
    Wang, Jinting
    Zhang, Xuelu
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (22) : 6883 - 6902
  • [3] Equilibrium Joining Strategies of Delay-Sensitive Customers in a Queueing System with Service Quality Feedback
    Liu, Peng
    Lv, Jun
    Jiang, Tao
    Chai, Xudong
    [J]. DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2020, 2020
  • [4] Strategic Outsourcing with Delay-Sensitive Customers
    Qiang, Lu
    Chen, Li
    Chiang, Wei-yu Kevin
    [J]. PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON OPERATIONS AND SUPPLY CHAIN MANAGEMENT (ICOSCM 2010), 2010, 4 : 439 - 444
  • [5] Non-Gatekeeping on Social Media: A Reputation Monitoring Approach and its Application in Tourism Services
    Ntalianis, Klimis
    Kavoura, Androniki
    Tomaras, Peter
    Drigas, Athanasios
    [J]. JOURNAL OF TOURISM AND SERVICES, 2015, 6 (10): : 19 - 44
  • [6] Optimal pricing and capacity management in service systems with delay-sensitive mixed-risk customers
    Deligiannis, Michalis
    Benioudakis, Myron
    Liberopoulos, George
    Burnetas, Apostolos
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (21) : 7877 - 7903
  • [8] Pooled vs. Dedicated Queues when Customers Are Delay-Sensitive
    Sunar, Nur
    Tu, Yichen
    Ziya, Serhan
    [J]. MANAGEMENT SCIENCE, 2021, 67 (06) : 3785 - 3802
  • [9] Research on Deployment of Service Function Chains for Delay-Sensitive Services
    Zhao, Dongcheng
    Xie, Jingzhao
    Sun, Gang
    [J]. Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2021, 50 (06): : 852 - 860
  • [10] An efficient quality of service routing algorithm for delay-sensitive applications
    Liu, W
    Lou, WJ
    Fang, YG
    [J]. COMPUTER NETWORKS, 2005, 47 (01) : 87 - 104