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

Pricing Time-Sensitive Services Based on Realized Performance

Author

Listed:
  • Philipp Afèche

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

  • Opher Baron

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

  • Yoav Kerner

    (Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer Sheva 84105, Israel)

Abstract

Services such as FedEx charge up-front fees but reimburse customers for delays. However, lead-time pricing studies ignore such delay refunds. This paper contributes to filling this gap. It studies revenue-maximizing tariffs that depend on realized lead times for a provider serving multiple time-sensitive customer types. We relax two key assumptions of the standard model in the lead-time pricing literature. First, customers may be risk averse (RA) with respect to payoff uncertainty, where payoff equals valuation, minus delay cost, minus payment. Second, tariffs may be arbitrary functions of realized lead times. The standard model assumes risk-neutral (RN) customers and restricts attention to flat rates. We report three main findings: (1) With RN customers, flat-rate pricing maximizes revenues but leaves customers exposed to payoff variability. (2) With RA customers, flat-rate pricing is suboptimal. If types are distinguishable, the optimal lead-time-dependent tariffs fully insure delay cost risk and yield the same revenue as under optimal flat rates for RN customers. With indistinguishable RA types, the differentiated first-best tariffs may be incentive-compatible even for uniform service, yielding higher revenues than with RN customers. (3) Under price and capacity optimization, lead-time-dependent pricing yields higher profits with less capacity compared to flat-rate pricing.

Suggested Citation

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

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/msom.2013.0434?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. David W. Low, 1974. "Optimal Dynamic Pricing Policies for an M / M / s Queue," Operations Research, INFORMS, vol. 22(3), pages 545-561, June.
    2. Pascal Courty & Li Hao, 2000. "Sequential Screening," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 67(4), pages 697-717.
    3. So, Kut C. & Song, Jing-Sheng, 1998. "Price, delivery time guarantees and capacity selection," European Journal of Operational Research, Elsevier, vol. 111(1), pages 28-49, November.
    4. Mark L. Spearman & Rachel Q. Zhang, 1999. "Optimal Lead Time Policies," Management Science, INFORMS, vol. 45(2), pages 290-295, February.
    5. Lawrence M. Wein, 1991. "Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue," Management Science, INFORMS, vol. 37(7), pages 834-850, July.
    6. Joseph E. Stiglitz, 1977. "Monopoly, Non-linear Pricing and Imperfect Information: The Insurance Market," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 44(3), pages 407-430.
    7. 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.
    8. Izak Duenyas & Wallace J. Hopp, 1995. "Quoting Customer Lead Times," Management Science, INFORMS, vol. 41(1), pages 43-57, January.
    9. Guillermo Gallego & Özge Şahin, 2010. "Revenue Management with Partially Refundable Fares," Operations Research, INFORMS, vol. 58(4-part-1), pages 817-833, August.
    10. Michael Rothschild & Joseph Stiglitz, 1976. "Equilibrium in Competitive Insurance Markets: An Essay on the Economics of Imperfect Information," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 90(4), pages 629-649.
    11. 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.
    12. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    13. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    14. Charles A. Holt & Susan K. Laury, 2002. "Risk Aversion and Incentive Effects," American Economic Review, American Economic Association, vol. 92(5), pages 1644-1655, December.
    15. Jiejian Feng & Liming Liu & Xiaoming Liu, 2011. "TECHNICAL NOTE---An Optimal Policy for Joint Dynamic Price and Lead-Time Quotation," Operations Research, INFORMS, vol. 59(6), pages 1523-1527, December.
    16. 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.
    17. Pengfei Guo & Paul Zipkin, 2007. "Analysis and Comparison of Queues with Different Levels of Delay Information," Management Science, INFORMS, vol. 53(6), pages 962-970, June.
    18. 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.
    19. Izak Duenyas, 1995. "Single Facility Due Date Setting with Multiple Customer Classes," Management Science, INFORMS, vol. 41(4), pages 608-619, April.
    20. Qian Liu & Garrett J. van Ryzin, 2008. "Strategic Capacity Rationing to Induce Early Purchases," Management Science, INFORMS, vol. 54(6), pages 1115-1131, June.
    21. Gad Allon & Achal Bassamboo & Itai Gurvich, 2011. "“We Will Be Right with You”: Managing Customer Expectations with Vague Promises and Cheap Talk," Operations Research, INFORMS, vol. 59(6), pages 1382-1394, December.
    22. Albert Y. Ha, 2001. "Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements," Management Science, INFORMS, vol. 47(7), pages 915-930, July.
    23. Charnsirisakskul, Kasarin & Griffin, Paul M. & Keskinocak, Pinar, 2006. "Pricing and scheduling decisions with leadtime flexibility," European Journal of Operational Research, Elsevier, vol. 171(1), pages 153-169, May.
    24. Michael Landsberger & Isaac Meilijson, 1999. "A general model of insurance under adverse selection," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 14(2), pages 331-352.
    25. 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.
    26. 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.
    27. 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.
    28. Hassin, Refael, 1986. "Consumer Information in Markets with Random Product Quality: The Case of Queues and Balking," Econometrica, Econometric Society, vol. 54(5), pages 1185-1195, September.
    29. Gad Allon & Awi Federgruen, 2007. "Competition in Service Industries," Operations Research, INFORMS, vol. 55(1), pages 37-55, February.
    30. Mor Armony & Nahum Shimkin & Ward Whitt, 2009. "The Impact of Delay Announcements in Many-Server Queues with Abandonment," Operations Research, INFORMS, vol. 57(1), pages 66-81, February.
    31. Teck H. Ho & Yu-Sheng Zheng, 2004. "Setting Customer Expectation in Service Delivery: An Integrated Marketing-Operations Perspective," Management Science, INFORMS, vol. 50(4), pages 479-488, April.
    32. Tingliang Huang & Gad Allon & Achal Bassamboo, 2013. "Bounded Rationality in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 263-279, May.
    33. Ward Whitt, 1999. "Improving Service by Informing Customers About Anticipated Delays," Management Science, INFORMS, vol. 45(2), pages 192-207, February.
    34. Erica L. Plambeck, 2004. "Optimal Leadtime Differentiation via Diffusion Approximations," Operations Research, INFORMS, vol. 52(2), pages 213-228, April.
    35. Mor Armony & Constantinos Maglaras, 2004. "Contact Centers with a Call-Back Option and Real-Time Delay Information," Operations Research, INFORMS, vol. 52(4), pages 527-545, August.
    36. Sunil Kumar & Ramandeep S. Randhawa, 2010. "Exploiting Market Size in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 511-526, September.
    37. Kenneth R. Baker, 1984. "Sequencing Rules and Due-Date Assignments in a Job Shop," Management Science, INFORMS, vol. 30(9), pages 1093-1104, September.
    38. 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.
    39. Sanjeev Dewan & Haim Mendelson, 1990. "User Delay Costs and Internal Pricing for a Service Facility," Management Science, INFORMS, vol. 36(12), pages 1502-1517, December.
    40. Rafael Hassin, 1995. "Decentralized Regulation of a Queue," Management Science, INFORMS, vol. 41(1), pages 163-173, January.
    41. Albert Y. Ha, 1998. "Incentive-Compatible Pricing for a Service Facility with Joint Production and Congestion Externalities," Management Science, INFORMS, vol. 44(12-Part-1), pages 1623-1636, December.
    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. Feng, Jiejian & Zhang, Michael, 2017. "Dynamic quotation of leadtime and price for a Make-To-Order system with multiple customer classes and perfect information on customer preferences," European Journal of Operational Research, Elsevier, vol. 258(1), pages 334-342.
    2. 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.
    3. Benioudakis, Myron & Burnetas, Apostolos & Ioannou, George, 2021. "Lead-time quotations in unobservable make-to-order systems with strategic customers: Risk aversion, load control and profit maximization," European Journal of Operational Research, Elsevier, vol. 289(1), pages 165-176.
    4. Lin, Xuxun & Wang, Haiyan, 2022. "Dynamic pricing for online information services considering service duration and quality level," Omega, Elsevier, vol. 109(C).
    5. 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.
    6. Xu, Xiaoping & Zhang, Mian & He, Ping, 2020. "Coordination of a supply chain with online platform considering delivery time decision," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    7. Benioudakis, Myron & Zissis, Dimitris & Burnetas, Apostolos & Ioannou, George, 2023. "Service provision on an aggregator platform with time-sensitive customers: Pricing strategies and coordination," International Journal of Production Economics, Elsevier, vol. 257(C).
    8. Myron Benioudakis & Apostolos Burnetas & George Ioannou, 2022. "Single versus dynamic lead-time quotations in make-to-order systems with delay-averse customers," Annals of Operations Research, Springer, vol. 318(1), pages 33-65, November.
    9. Zolfagharinia, Hossein & Haughton, Michael, 2018. "The importance of considering non-linear layover and delay costs for local truckers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 331-355.

    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. 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.
    2. 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.
    3. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2016. "Price and Lead Time Quotation for Contract and Spot Customers," Operations Research, INFORMS, vol. 64(2), pages 406-415, April.
    4. Vasiliki Kostami, 2020. "Price and Lead time Disclosure Strategies in Inventory Systems," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2760-2788, December.
    5. Erica L. Plambeck, 2004. "Optimal Leadtime Differentiation via Diffusion Approximations," Operations Research, INFORMS, vol. 52(2), pages 213-228, April.
    6. 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.
    7. 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.
    8. Rouba Ibrahim, 2018. "Sharing delay information in service systems: a literature survey," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 49-79, June.
    9. 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.
    10. Jiejian Feng & Liming Liu & Xiaoming Liu, 2011. "TECHNICAL NOTE---An Optimal Policy for Joint Dynamic Price and Lead-Time Quotation," Operations Research, INFORMS, vol. 59(6), pages 1523-1527, December.
    11. 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.
    12. Slotnick, Susan A. & Sobel, Matthew J., 2005. "Manufacturing lead-time rules: Customer retention versus tardiness costs," European Journal of Operational Research, Elsevier, vol. 163(3), pages 825-856, June.
    13. Gökçe Kahveciog̃lu & Barış Balcıog̃lu, 2016. "Coping with production time variability via dynamic lead-time quotation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 877-898, October.
    14. Qiuping Yu & Gad Allon & Achal Bassamboo & Seyed Iravani, 2018. "Managing Customer Expectations and Priorities in Service Systems," Management Science, INFORMS, vol. 64(8), pages 3942-3970, August.
    15. 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.
    16. Zhu, Stuart X., 2015. "Integration of capacity, pricing, and lead-time decisions in a decentralized supply chain," International Journal of Production Economics, Elsevier, vol. 164(C), pages 14-23.
    17. Zhang, Jian & Nault, Barrie R. & Tu, Yiliu, 2015. "A dynamic pricing strategy for a 3PL provider with heterogeneous customers," International Journal of Production Economics, Elsevier, vol. 169(C), pages 31-43.
    18. Lu, Yuwei & Xie, Xiaolan & Jiang, Zhibin, 2018. "Dynamic appointment scheduling with wait-dependent abandonment," European Journal of Operational Research, Elsevier, vol. 265(3), pages 975-984.
    19. Balcıõglu, Barış & Varol, Yãgız, 2022. "Fair and profitable: How pricing and lead-time quotation policies can help," European Journal of Operational Research, Elsevier, vol. 299(3), pages 977-986.
    20. Benioudakis, Myron & Burnetas, Apostolos & Ioannou, George, 2021. "Lead-time quotations in unobservable make-to-order systems with strategic customers: Risk aversion, load control and profit maximization," European Journal of Operational Research, Elsevier, vol. 289(1), pages 165-176.

    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:492-506. 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.