IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v15y2013i3p423-443.html
   My bibliography  Save this article

Incentive-Compatible Revenue Management in Queueing Systems: Optimal Strategic Delay

Author

Listed:
  • Philipp Afèche

    (Rotman School of Management, University of Toronto, Toronto, Ontario M5S 3E6, Canada)

Abstract

How should a firm design a price/lead-time menu and scheduling policy to maximize revenues from heterogeneous time-sensitive customers with private information about their preferences? We consider this question for a queueing system with two customer types and provide the following results. First, we develop a novel problem formulation and solution method that combines the achievable region approach with mechanism design. This approach extends to menu design problems for other systems. Second, the work conserving c μ priority rule, known to be delay cost minimizing, incentive-compatible, and socially optimal, need not be revenue maximizing. A strategic delay policy may be optimal: It prioritizes impatient customers, but artificially inflates the lead times of patient customers. This suggests a broader guideline: Revenue-maximizing firms that lack customer-level demand information should also consider customer incentives, not only operational constraints, in their scheduling policies. Third, we identify general necessary and sufficient conditions for optimal strategic delay: a price , a lead-time , and a segment-size condition. We translate these into demand and capacity parameter conditions for cases with homogeneous and heterogeneous valuations for each type. In some cases strategic delay is optimal if capacity is relatively abundant, in others if it is relatively scarce.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:ormsom:v:15:y:2013:i:3:p:423-443
    DOI: 10.1287/msom.2013.0449
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2013.0449
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2013.0449?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. A. Federgruen & H. Groenevelt, 1988. "Characterization and Optimization of Achievable Performance in General Queueing Systems," Operations Research, INFORMS, vol. 36(5), pages 733-741, October.
    2. Gad Allon & Awi Federgruen, 2009. "Competition in Service Industries with Segmented Markets," Management Science, INFORMS, vol. 55(4), pages 619-634, April.
    3. John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, February.
    4. Phillip J. Lederer & Lode Li, 1997. "Pricing, Production, Scheduling, and Delivery-Time Competition," Operations Research, INFORMS, vol. 45(3), pages 407-420, June.
    5. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    6. S. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, February.
    7. Wallace J. Hopp & Seyed M. R. Iravani & Gigi Y. Yuen, 2007. "Operations Systems with Discretionary Task Completion," Management Science, INFORMS, vol. 53(1), pages 61-77, January.
    8. Jayaswal, Sachin & Jewkes, Elizabeth & Ray, Saibal, 2011. "Product differentiation and operations strategy in a capacitated environment," European Journal of Operational Research, Elsevier, vol. 210(3), pages 716-728, May.
    9. Vernon N. Hsu & Susan H. Xu & Boris Jukic, 2009. "Optimal Scheduling and Incentive Compatible Pricing for a Service System with Quality of Service Guarantees," Manufacturing & Service Operations Management, INFORMS, vol. 11(3), pages 375-396, May.
    10. Mussa, Michael & Rosen, Sherwin, 1978. "Monopoly and product quality," Journal of Economic Theory, Elsevier, vol. 18(2), pages 301-317, August.
    11. E. G. Coffman & I. Mitrani, 1980. "A Characterization of Waiting Time Performance Realizable by Single-Server Queues," Operations Research, INFORMS, vol. 28(3-part-ii), pages 810-821, June.
    12. Jan A. Van Mieghem, 2000. "Price and Service Discrimination in Queuing Systems: Incentive Compatibility of Gc\mu Scheduling," Management Science, INFORMS, vol. 46(9), pages 1249-1267, September.
    13. Constantinos Maglaras & Assaf Zeevi, 2005. "Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights," Operations Research, INFORMS, vol. 53(2), pages 242-262, April.
    14. Jean-Charles Rochet & Philippe Chone, 1998. "Ironing, Sweeping, and Multidimensional Screening," Econometrica, Econometric Society, vol. 66(4), pages 783-826, July.
    15. 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.
    16. Tamer Boyaci & Saibal Ray, 2003. "Product Differentiation and Capacity Cost Interaction in Time and Price Sensitive Markets," Manufacturing & Service Operations Management, INFORMS, vol. 5(1), pages 18-36, May.
    17. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    18. Xuanming Su & Stefanos A. Zenios, 2006. "Recipient Choice Can Address the Efficiency-Equity Trade-off in Kidney Transplantation: A Mechanism Design Model," Management Science, INFORMS, vol. 52(11), pages 1647-1660, November.
    19. Laurens G. Debo & L. Beril Toktay & Luk N. Van Wassenhove, 2008. "Queuing for Expert Services," Management Science, INFORMS, vol. 54(8), pages 1497-1512, August.
    20. Haim Mendelson & Seungjin Whang, 1990. "Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue," Operations Research, INFORMS, vol. 38(5), pages 870-883, October.
    21. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    22. Erica L. Plambeck, 2004. "Optimal Leadtime Differentiation via Diffusion Approximations," Operations Research, INFORMS, vol. 52(2), pages 213-228, April.
    23. Sabri Çelik & Costis Maglaras, 2008. "Dynamic Pricing and Lead-Time Quotation for a Multiclass Make-to-Order Queue," Management Science, INFORMS, vol. 54(6), pages 1132-1146, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jing Dong & Ohad Perry, 2020. "Queueing Models for Patient-Flow Dynamics in Inpatient Wards," Operations Research, INFORMS, vol. 68(1), pages 250-275, January.
    2. Xu Yong & Liu Jian & Zhang Shuai & Ma Baomei, 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.
    3. Opher Baron & Antonis Economou & Athanasia Manou, 2022. "Increasing social welfare with delays: Strategic customers in the M/G/1 orbit queue," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 2907-2924, July.
    4. 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).
    5. Bodas, Tejas & Manjunath, D., 2019. "Revenue maximization in service systems with heterogeneous customers," European Journal of Operational Research, Elsevier, vol. 278(2), pages 686-698.
    6. 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.
    7. 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.
    8. Somayeh Sadat & Hossein Abouee-Mehrizi & Michael Carter, 2015. "Can hospitals compete on quality?," Health Care Management Science, Springer, vol. 18(3), pages 376-388, September.
    9. Chai, Xudong & Jiang, Tao & Chang, Baoxian & Liu, Liwei, 2021. "On a multiple priorities matching system with heterogeneous delay sensitive individuals," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    10. Llanos R. L. F., 2016. "A study on call/contact centers' inbound and outbound management process," South Asian Journal of Management Sciences (SAJMS), Iqra University, Iqra University, vol. 10(2), pages 1-10, Fall.
    11. Michael O. Ball & Alexander S. Estes & Mark Hansen & Yulin Liu, 2020. "Quantity-Contingent Auctions and Allocation of Airport Slots," Transportation Science, INFORMS, vol. 54(4), pages 858-881, July.
    12. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    13. 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.

    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. 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.
    2. Vibhanshu Abhishek & Mustafa Dogan & Alexandre Jacquillat, 2021. "Strategic Timing and Dynamic Pricing for Online Resource Allocation," Management Science, INFORMS, vol. 67(8), pages 4880-4907, August.
    3. Philipp Afèche & Opher Baron & Joseph Milner & Ricky Roet-Green, 2019. "Pricing and Prioritizing Time-Sensitive Customers with Heterogeneous Demand Rates," Operations Research, INFORMS, vol. 67(4), pages 1184-1208, July.
    4. Tianhu Deng & Ying‐Ju Chen & Zuo‐Jun Max Shen, 2015. "Optimal pricing and scheduling control of product shipping," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(3), pages 215-227, April.
    5. 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.
    6. Philipp Afèche & Opher Baron & Yoav Kerner, 2013. "Pricing Time-Sensitive Services Based on Realized Performance," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 492-506, July.
    7. Barış Ata & Tava Lennon Olsen, 2009. "Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs," Operations Research, INFORMS, vol. 57(3), pages 753-768, June.
    8. William P. Barnett & Daniel A. Levinthal, 2017. "Special Issue Introduction: Evolutionary Logics of Strategy and Organization," Strategy Science, INFORMS, vol. 2(1), pages 1-1, March.
    9. Ying Xu & Alan Scheller-Wolf & Katia Sycara, 2015. "The Benefit of Introducing Variability in Single-Server Queues with Application to Quality-Based Service Domains," Operations Research, INFORMS, vol. 63(1), pages 233-246, February.
    10. Jain, Aditya & Bala, Ram, 2018. "Differentiated or integrated: Capacity and service level choice for differentiated products," European Journal of Operational Research, Elsevier, vol. 266(3), pages 1025-1037.
    11. Weixin Shang & Liming Liu, 2011. "Promised Delivery Time and Capacity Games in Time-Based Competition," Management Science, INFORMS, vol. 57(3), pages 599-610, March.
    12. Luyi Yang & Laurens Debo & Varun Gupta, 2017. "Trading Time in a Congested Environment," Management Science, INFORMS, vol. 63(7), pages 2377-2395, July.
    13. Xiaojun Liang & Yinghui Tang, 2019. "The improvement upon the reliability of the k-out-of-n:F system with the repair rates differentiation policy," Operational Research, Springer, vol. 19(2), pages 479-500, June.
    14. Mustafa Akan & Barı ş Ata & Tava Olsen, 2012. "Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions," Operations Research, INFORMS, vol. 60(6), pages 1505-1519, December.
    15. Erica L. Plambeck, 2004. "Optimal Leadtime Differentiation via Diffusion Approximations," Operations Research, INFORMS, vol. 52(2), pages 213-228, April.
    16. Terry A. Taylor, 2018. "On-Demand Service Platforms," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 704-720, October.
    17. Yasushi Masuda & Seungjin Whang, 2006. "On the Optimality of Fixed-up-to Tariff for Telecommunications Service," Information Systems Research, INFORMS, vol. 17(3), pages 247-253, September.
    18. Ryan W. Buell & Dennis Campbell & Frances X. Frei, 2016. "How Do Customers Respond to Increased Service Quality Competition?," Manufacturing & Service Operations Management, INFORMS, vol. 18(4), pages 585-607, October.
    19. Anthony M. Kwasnica & Euthemia Stavrulaki, 2008. "Competitive location and capacity decisions for firms serving time‐sensitive customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 704-721, October.
    20. 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.

    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:inm:ormsom:v:15:y:2013:i:3:p:423-443. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.