IDEAS home Printed from https://ideas.repec.org/a/bpj/jossai/v6y2018i6p481-494n1.html
   My bibliography  Save this article

Service Mechanism and Pricing Based on Fairness Preference of Customers in Queuing System

Author

Listed:
  • Xu Yong

    (School of Economics and Management, Nanjing University of Science and Technology, Nanjing, 210094, China)

  • Liu Jian

    (School of Economics and Management, Nanjing University of Science and Technology, Nanjing, 210094, China)

  • Ma Baomei

    (School of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, 211106, China)

  • Zhang Shuai

    (School of Economics and Management, Nanjing University of Science and Technology, Nanjing, 210094, China)

Abstract

Service providers often adopt the mechanism of customer classification due to the heterogeneity of customer waiting cost. However, the classification service may cause unfairness feeling of regular customers, then affect the revenue and social welfare. This paper provides the first exact analysis about the situation that service providers offer two classes of non-preemptive priority service when customer fairness perception is explicitly modeled. We model customer fairness perception as a negative utility on regular customers that’s proportional to the waiting time difference between the two queues. By analyzing a stylized M/M/1 queue in monopoly service system, we can derive important results some of which reaffirm existed research results. First, from the perspective of revenue maximization, service providers should also adopt the mechanism of customer classification and set up the two kinds of customers where they can see each other. Next, considering customer utility maximization, service providers should cancel the mechanism of customer classification, and keep one queue (regular customers) only. Then, from the perspective of social welfare maximization, service providers should also adopt the mechanism of customer classification but set up the two kinds of customers where they cannot feel each other. Finally, this paper concludes the optimal pricing based on customer classification in the above three different perspectives. This research shows important reference value and practical significance for service providers who adopt the mechanism of classification service.

Suggested Citation

  • Xu Yong & Liu Jian & Ma Baomei & Zhang Shuai, 2018. "Service Mechanism and Pricing Based on Fairness Preference of Customers in Queuing System," Journal of Systems Science and Information, De Gruyter, vol. 6(6), pages 481-494, December.
  • Handle: RePEc:bpj:jossai:v:6:y:2018:i:6:p:481-494:n:1
    DOI: 10.21078/JSSI-2018-481-14
    as

    Download full text from publisher

    File URL: https://doi.org/10.21078/JSSI-2018-481-14
    Download Restriction: no

    File URL: https://libkey.io/10.21078/JSSI-2018-481-14?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Michael Pinedo, 1983. "Stochastic Scheduling with Release Dates and Due Dates," Operations Research, INFORMS, vol. 31(3), pages 559-572, June.
    2. Philipp Afèche, 2013. "Incentive-Compatible Revenue Management in Queueing Systems: Optimal Strategic Delay," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 423-443, July.
    3. Srinagesh Gavirneni & Vidyadhar G. Kulkarni, 2016. "Self-Selecting Priority Queues with Burr Distributed Waiting Costs," Production and Operations Management, Production and Operations Management Society, vol. 25(6), pages 979-992, June.
    4. Philipp Afèche & Haim Mendelson, 2004. "Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure," Management Science, INFORMS, vol. 50(7), pages 869-882, July.
    5. Alexander, Matthew & MacLaren, Andrew & O’Gorman, Kevin & White, Christopher, 2012. "Priority queues: Where social justice and equity collide," Tourism Management, Elsevier, vol. 33(4), pages 875-884.
    6. Leonard Kleinrock, 1967. "Optimum Bribing for Queue Position," Operations Research, INFORMS, vol. 15(2), pages 304-318, April.
    7. Richard C. Larson, 1987. "OR Forum—Perspectives on Queues: Social Justice and the Psychology of Queueing," Operations Research, INFORMS, vol. 35(6), pages 895-905, December.
    8. Achal Bassamboo & Ramandeep Singh Randhawa, 2016. "Scheduling Homogeneous Impatient Customers," Management Science, INFORMS, vol. 62(7), pages 2129-2147, July.
    9. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    10. Hamid Nazerzadeh & Ramandeep S. Randhawa, 2018. "Near†Optimality of Coarse Service Grades for Customer Differentiation in Queueing Systems," Production and Operations Management, Production and Operations Management Society, vol. 27(3), pages 578-595, March.
    11. Xin Geng & Woonghee Tim Huh & Mahesh Nagarajan, 2015. "Fairness Among Servers When Capacity Decisions Are Endogenous," Production and Operations Management, Production and Operations Management Society, vol. 24(6), pages 961-974, June.
    12. Philipp Afèche & J. Michael Pavlin, 2016. "Optimal Price/Lead-Time Menus for Queues with Customer Choice: Segmentation, Pooling, and Strategic Delay," Management Science, INFORMS, vol. 62(8), pages 2412-2436, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Jian & Chen, Jian & Bo, Rui & Meng, Fanlin & Xu, Yong & Li, Peng, 2023. "Increases or discounts: Price strategies based on customers’ patience times," European Journal of Operational Research, Elsevier, vol. 305(2), pages 722-737.
    2. Zhao, Chen & Wang, Zhongbin, 2023. "The impact of line-sitting on a two-server queueing system," European Journal of Operational Research, Elsevier, vol. 308(2), pages 782-800.
    3. Shiliang Cui & Zhongbin Wang & Luyi Yang, 2020. "The Economics of Line-Sitting," Management Science, INFORMS, vol. 66(1), pages 227-242, January.
    4. Luyi Yang & Zhongbin Wang & Shiliang Cui, 2021. "A Model of Queue Scalping," Management Science, INFORMS, vol. 67(11), pages 6803-6821, November.
    5. Itai Gurvich & Martin A. Lariviere & Can Ozkan, 2019. "Coverage, Coarseness, and Classification: Determinants of Social Efficiency in Priority Queues," Management Science, INFORMS, vol. 65(3), pages 1061-1075, March.
    6. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    7. Manlu Chen & Ming Hu & Jianfu Wang, 2022. "Food Delivery Service and Restaurant: Friend or Foe?," Management Science, INFORMS, vol. 68(9), pages 6539-6551, September.
    8. Yiwei Chen & Vivek F. Farias & Nikolaos Trichakis, 2019. "On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers," Management Science, INFORMS, vol. 65(12), pages 5535-5555, December.
    9. İşlier, Zeynep Gökçe & Güllü, Refik, 2024. "On strategic customers with correlated utility attributes: Effects and information benefits," European Journal of Operational Research, Elsevier, vol. 313(1), pages 258-269.
    10. Wenqing Wu & Yuanyuan Zhang, 2020. "Analysis of a Markovian queue with customer interjections and finite buffer," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 301-319, June.
    11. Pavlin, J. Michael, 2017. "Dual bounds of a service level assignment problem with applications to efficient pricing," European Journal of Operational Research, Elsevier, vol. 262(1), pages 239-250.
    12. Chamberlain, Jonathan & Simhon, Eran & Starobinski, David, 2021. "Preemptible queues with advance reservations: Strategic behavior and revenue management," European Journal of Operational Research, Elsevier, vol. 293(2), pages 561-578.
    13. De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).
    14. Gad Allon & Awi Federgruen, 2007. "Competition in Service Industries," Operations Research, INFORMS, vol. 55(1), pages 37-55, February.
    15. Jalili Marand, Ata & Tang, Ou & Li, Hongyan, 2019. "Quandary of service logistics: Fast or reliable?," European Journal of Operational Research, Elsevier, vol. 275(3), pages 983-996.
    16. Benjamin Legros, 2021. "Agents’ Self‐Routing for Blended Operations to Balance Inbound and Outbound Services," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3599-3614, October.
    17. Yina Lu & Andrés Musalem & Marcelo Olivares & Ariel Schilkrut, 2013. "Measuring the Effect of Queues on Customer Purchases," Management Science, INFORMS, vol. 59(8), pages 1743-1763, August.
    18. Zhongbin Wang & Luyi Yang & Shiliang Cui & Jinting Wang, 2021. "In-queue priority purchase: a dynamic game approach," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 343-381, April.
    19. Anouar El Haji & Sander Onderstal, 2019. "Trading places: An experimental comparison of reallocation mechanisms for priority queuing," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(4), pages 670-686, November.
    20. Hossein Abouee‐Mehrizi & Ata Ghareaghaji Zare & Renata A. Konrad, 2022. "Pricing in Service Systems with Rational Balking and Abandonment of Time‐Sensitive Customers," Production and Operations Management, Production and Operations Management Society, vol. 31(2), pages 495-510, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bpj:jossai:v:6:y:2018:i:6:p:481-494:n:1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.