The Value of Dynamic Pricing in Large Queueing Systems

Published Online:https://doi.org/10.1287/opre.2017.1668

References

  • Afèche P, Ata B (2013) Bayesian dynamic pricing in queueing systems with unknown delay cost characteristics. Manufacturing Service Oper. Management 15(2):292–304.LinkGoogle Scholar
  • Ata B, Olsen TL (2009) Near-optimal dynamic lead-time quotation and scheduling under convex-concave customer delay costs. Oper. Res. 57(3):753–768.LinkGoogle Scholar
  • Ata B, Olsen T (2013) Congestion-based lead time quotation and pricing for revenue maximization with heterogeneous customers. Queueing Systems 73(1):35–78.CrossrefGoogle Scholar
  • Ata B, Shneorson S (2006) Dynamic control of an M/M/1 service system with adjustable arrival and service rates. Management Sci. 52(11):1778–1791.LinkGoogle Scholar
  • Besbes O, Maglaras C (2010) Revenue optimization for a make-to-order queue in an uncertain market environment. Oper. Res. 57(6):1438–1450.LinkGoogle Scholar
  • Besbes O, Zeevi A (2012) Blind network revenue management. Oper. Res. 60(6):1537–1550.LinkGoogle Scholar
  • Cachon G, Feldman P (2011) Pricing services subject to congestion: Charge per-use fees or sell subscriptions? Manufacturing Service Oper. Management 13(2):244–260.LinkGoogle Scholar
  • Çelik S, Maglaras C (2008) Dynamic pricing and lead-time quotation for a multiclass make-to-order queue. Management Sci. 54(6):1132–1146.LinkGoogle Scholar
  • Chen H, Frank MZ (2001) State dependent pricing with a queue. IIE Trans. 33(10):847–860.CrossrefGoogle Scholar
  • Çil EB, Karaesmen F, Örmeci EL (2011) Dynamic pricing and scheduling in a multi-class single-server queueing system. Queueing Systems 67(4):305–331.CrossrefGoogle Scholar
  • Eren S, Maglaras C (2010) Monopoly pricing with limited demand information. J. Revenue and Pricing Management 9(1–2):23–48.CrossrefGoogle Scholar
  • Farias V, Van Roy B (2010) Dynamic pricing with a prior on market response. Oper. Res. 58(1):16–29.LinkGoogle Scholar
  • Ghosh AP, Weerasinghe AP (2007) Optimal buffer size for a stochastic processing network in heavy traffic. Queueing Systems 55(3):147–159.CrossrefGoogle Scholar
  • Haviv M, Randhawa R (2014) Pricing in queues without demand information. Manufacturing Service Oper. Management 16(3):401–411.LinkGoogle Scholar
  • Low D (1974) Optimal dynamic pricing policies for an M/M/s queue. Oper. Res. 22(3):545–561.LinkGoogle Scholar
  • Maglaras C (2006) Revenue management for a multiclass single-server queue via a fluid model analysis. Oper. Res. 54(5):914–932.LinkGoogle Scholar
  • Maglaras C, Zeevi A (2003) Pricing and capacity sizing for systems with shared resources: Approximate solutions and scaling relations. Management Sci. 49(8):1018–1038.LinkGoogle Scholar
  • Mendelson H, Whang S (1990) Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. 38(5):870–883.LinkGoogle Scholar
  • Naor P (1969) The regulation of queue size by levying tolls. Econometrica 37(1):15–24.CrossrefGoogle Scholar
  • Netessine S (2006) Dynamic pricing of inventory/capacity with infrequent price changes. Eur. J. Oper. Res. 174:553–580.CrossrefGoogle Scholar
  • Paschalidis I, Tsitsiklis J (2000) Congestion-dependent pricing of network services. IEEE/ACM Trans. Networking 8(2):171–184.CrossrefGoogle Scholar
  • Plambeck E, Ward A (2008) Optimal control of a high volume assemble-to-order system with leadtime quotation and expediting. Queueing Systems 60(1):1–69.CrossrefGoogle Scholar
  • Puterman M (2009) Markov Decision Processes: Discrete Stochastic Dynamic Programming, Vol. 414 (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Roth AE (2006) Repugnance as a constraint on markets. Technical report, National Bureau of Economic Research.Google Scholar
  • Yoon S, Lewis M (2004) Optimal pricing and admission control in a queueing system with periodically varying parameters. Queueing Systems 47:177–199.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.