View Item 

Show simple item record

Revenue Management of Reusable Resources with Advanced Reservations
dc.contributor.authorChen, Yiwei
dc.contributor.authorLevi, Retsef
dc.contributor.authorShi, Cong
dc.date.accessioned2017-06-16T20:16:03Z
dc.date.available2018-07-09T17:42:25Zen
dc.date.issued2017-05
dc.identifier.citationChen, Yiwei; Levi, Retsef; Shi, Cong (2017). "Revenue Management of Reusable Resources with Advanced Reservations." Production and Operations Management 26(5): 836-859.
dc.identifier.issn1059-1478
dc.identifier.issn1937-5956
dc.identifier.urihttps://hdl.handle.net/2027.42/137568
dc.publisherUniversity of Michigan
dc.publisherWiley Periodicals, Inc.
dc.subject.otheralgorithms
dc.subject.otherrevenue management
dc.subject.otherloss network
dc.subject.otheradvanced reservation
dc.subject.otherblocking probability
dc.subject.otherreusable resources
dc.titleRevenue Management of Reusable Resources with Advanced Reservations
dc.typeArticleen_US
dc.rights.robotsIndexNoFollow
dc.subject.hlbsecondlevelIndustrial and Operations Engineering
dc.subject.hlbtoplevelEngineering
dc.description.peerreviewedPeer Reviewed
dc.description.bitstreamurlhttps://deepblue.lib.umich.edu/bitstream/2027.42/137568/1/poms12672_am.pdf
dc.description.bitstreamurlhttps://deepblue.lib.umich.edu/bitstream/2027.42/137568/2/poms12672.pdf
dc.identifier.doi10.1111/poms.12672
dc.identifier.sourceProduction and Operations Management
dc.identifier.citedreferenceÖzer, Ö., R. Phillips. 2012. The Oxford Handbook of Pricing Management. Oxford University Press, Oxford, UK.
dc.identifier.citedreferenceLu, Y., A. Radovanovic. 2007. Asymptotic blocking probabilities in loss networks with subexponential demands. J. Appl. Probab. 44 ( 4 ): 1088 – 1102.
dc.identifier.citedreferenceLuss, H. 1977. A model for advanced reservations for intercity visual conferencing services. J. Oper. Res. Soc. 28 ( 2 ): 275 – 284.
dc.identifier.citedreferenceMaglaras, C. 2006. Revenue management for a multiclass single‐server queue via an uid model analysis. Oper. Res. 54 ( 5 ): 914 – 932.
dc.identifier.citedreferenceMaillardet, R. J., P. G. Taylor. 2016. Queues with advanced reservations: An infinite‐server proxy for the bookings diary. Adv. Appl. Prob. 48 ( 1 ): 13 – 31.
dc.identifier.citedreferenceMak, H.‐Y., Y. Rong, J. Zhang. 2014. Appointment scheduling with limited distributional information. Management Sci. 61 ( 2 ): 316 – 334.
dc.identifier.citedreferenceMassey, W. A. 1985. Asymptotic analysis of the time dependent M / M /1 queue. Math. Oper. Res. 10 ( 2 ): 305 – 327.
dc.identifier.citedreferenceMiller, B. 1969. A queueing reward system with several customer classes. Management Sci. 16 ( 3 ): 234 – 245.
dc.identifier.citedreferenceNadarajah, S., Y. F. Lim, Q. Ding. 2015. Dynamic pricing for hotel rooms when customers request multiple‐day stays. Working paper, University of Illinois at Chicago. Available at https://ssrn.com/abstract=2639188.
dc.identifier.citedreferencePuhalskii, A. A, M. I. Reiman. 1998. A critically loaded multirate link with trunk reservation. Queueing Syst. 28 ( 1–3 ): 157 – 190.
dc.identifier.citedreferenceRoss, K., D. Tsang. 1989. The stochastic knapsack problem. Management Sci. 37 ( 7 ): 740 – 747.
dc.identifier.citedreferenceRoss, K., D. Yao. 1990. Monotonicity properties for the stochastic knapsack. IEEE Trans. Inform. Theory 36 ( 5 ): 1173 – 1179.
dc.identifier.citedreferenceSchmidt, V. 1987. On joint queue‐length characteristics in infinite‐server tandem queues with heavy traffic. Adv. Appl. Prob. 19: 474 – 486.
dc.identifier.citedreferenceSevastyanov, B. A. 1957. An ergodic theorem for markov processes and its application to telephone systems with refusals. Theory Prob. Appl. 2 ( 1 ): 104 – 112.
dc.identifier.citedreferenceSpencer, J., M. Sudan, K. Xu. 2014. Queue with future information. Ann. Appl. Prob. 24 ( 5 ): 2091 – 2142.
dc.identifier.citedreferenceSrikant, R., W. Whitt. 2001. Resource sharing for book‐ahead and instantaneous‐request calls using a CLT approximation. Telecommun. Syst. 16 ( 3–4 ) 233 – 253.
dc.identifier.citedreferenceTalluri, K. T., G. J van Ryzin. 2005. The Theory and Practice of Revenue Management. Springer, New York.
dc.identifier.citedreferenceVirtamo, J. T., S. Aalto. 1991. Stochastic optimization of reservation systems. Eur. J. Oper. Res. 51 ( 3 ): 327 – 337.
dc.identifier.citedreferencevan de Vrugt, M., N. Litvak, R. J. Boucherie. 2014. Blocking probabilities in Erlang loss queues with advance reservation. Stoch. Model 30 ( 2 ): 187 – 196.
dc.identifier.citedreferenceWhitt, W. 1985. Blocking when service is required from several facilities simultaneously. AT&T Tech. J. 64: 1807 – 1856.
dc.identifier.citedreferenceWischik, D., A. Greenberg. 1998. Admission control for booking ahead shared resources. Proceedings of IEEE INFOCOM, San Francisco, CA, vol. 2, pp. 873 – 882.
dc.identifier.citedreferenceXu, K. 2015. Necessity of future information in admission control. Oper. Res. 63 ( 5 ): 1213 – 1226.
dc.identifier.citedreferenceZachary, S. 1991. On blocking in loss networks. Adv. Appl. Probab. 23 ( 2 ): 355 – 372.
dc.identifier.citedreferenceAdelman, D. 2006. A simple algebraic approximation to the Erlang loss system. Oper. Res. Lett. 36 ( 4 ): 484 – 491.
dc.identifier.citedreferenceAdelman, D. 2007. Price‐directed control of a closed logistics queuing network. Oper. Res. 55 ( 6 ): 1022 – 1038.
dc.identifier.citedreferenceBegen, M. A., M. Queyranne. 2011. Appointment scheduling with discrete random durations. Math. Oper. Res. 36 ( 2 ): 240 – 257.
dc.identifier.citedreferenceBegen, M. A., R. Levi, M. Queyranne. 2012. A sampling‐based approach to appointment scheduling. Oper. Res. 60 ( 3 ): 675 – 681.
dc.identifier.citedreferenceBesbes, O., C. Maglaras. 2009. Revenue optimization for a make‐to‐order queue in an uncertain market environment. Oper. Res. 57 ( 6 ): 1438 – 1450.
dc.identifier.citedreferenceden Boer, A. V. 2015. Dynamic pricing and learning: Historical origins, current research, and new directions. Surveys Oper. Res. Manage. Sci. 20 ( 1 ): 1 – 18.
dc.identifier.citedreferenceBorgs, C., O. Candogan, J. Chayes, I. Lobel, H. Nazerzadeh. 2014. Optimal multiperiod pricing with service guarantees. Management Sci. 60 ( 7 ): 1792 – 1811.
dc.identifier.citedreferenceBoxma, O. J. 1984. M / G /∞ tandem queues. Stoch. Proc. Appl. 18: 153 – 164.
dc.identifier.citedreferenceBurman, D. Y., J. P. Lehoczky, Y. Lim. 1984. Insensitivity of blocking probabilities in a circuit‐switching network. J. Appl. Probab. 21 ( 4 ): 850 – 859.
dc.identifier.citedreferenceChen, Y., C. Shi. 2016. Optimal pricing policy for service systems with reusable resources and forward‐looking customers. Working paper, University of Michigan.
dc.identifier.citedreferenceCoffman Jr., E. G., P. Jelenkovic, B. Poonen. 1999. Reservation probabilities. Adv. Perf. Anal. 2: 129 – 158.
dc.identifier.citedreferenceEick, S. G., W. A. Massey, W. Whitt. 1993a. Infinite‐server approximations for multi‐server loss models with time‐dependent arrival rates. Working paper, Columbia University.
dc.identifier.citedreferenceEick, S. G., W. A. Massey, W. Whitt. 1993b. The physics of the M t / G / ∞ queue. Oper. Res. 41 ( 4 ): 731 – 742.
dc.identifier.citedreferenceErlang, A. K. 1917. Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Elektrotkeknikeren 13: 5 – 13.
dc.identifier.citedreferenceFan‐Orzechowski, X., E. A. Feinberg. 2006. Optimality of randomized trunk reservation for a problem with a single constraint. Adv. Appl. Probab. 38 ( 1 ): 199 – 220.
dc.identifier.citedreferenceGallego, G., M. Hu. 2014. Dynamic pricing of perishable assets under competition. Management Sci. 60 ( 5 ): 1241 – 1259.
dc.identifier.citedreferenceGe, D., G. Wan, Z. Wang, J. Zhang. 2013. A note on appointment scheduling with piecewise linear cost functions. Math. Oper. Res. 39 ( 4 ): 1244 – 1251.
dc.identifier.citedreferenceGreenberg, A. G., R. Srikant, W. Whitt. 1999. Resource sharing for book‐ahead and instantaneous‐request calls. IEEE/ACM Trans. Netw. 7 ( 1 ) 10 – 22.
dc.identifier.citedreferenceGupta, D., B. Denton. 2008. Appointment scheduling in health care: Challenges and opportunities. IIE Trans. 40 ( 9 ): 800 – 819.
dc.identifier.citedreferenceHunt, P. J., C. N. Laws. 1997. Optimization via trunk reservation in single resource loss systems under heavy traffic. Ann. Appl. Probab. 7 ( 4 ): 1058 – 1079.
dc.identifier.citedreferenceIyengar, G., K. Sigman. 2004. Exponential penalty function control of loss networks. Ann. Appl. Probab. 14 ( 4 ): 1698 – 1740.
dc.identifier.citedreferenceKaandorp, G. C., G. Koole. 2007. Optimal outpatient appointment scheduling. Health Care Manage. Sci. 10 ( 3 ): 217 – 229.
dc.identifier.citedreferenceKarlin, S., H. E. Taylor. 1981. A Second Course in Stochastic Processes. Elsevier, New York.
dc.identifier.citedreferenceKaufman, J. S. 1981. Blocking in a shared resources environment. IEEE Trans. Comm. 29: 1474 – 1481.
dc.identifier.citedreferenceKelly, F. P. 1991. Effective bandwidths at multi‐class queues. Queueing Syst. 9 ( 1–2 ): 5 – 16.
dc.identifier.citedreferenceKey, P. 1990. Optimal control and trunk reservation in loss networks. Probab. Engrg. Informs. Sci. 4: 203 – 242.
dc.identifier.citedreferenceKong, Q., C.‐Y. Lee, C.‐P. Teo, Z. Zheng. 2013. Scheduling arrivals to a stochastic service delivery system using copositive cones. Oper. Res. 61 ( 3 ): 711 – 726.
dc.identifier.citedreferenceKumar, S., R. Srikant, P. R. Kumar. 1998. Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints. Queueing Syst. 28 ( 1–3 ) 55 – 77.
dc.identifier.citedreferenceLawler, G. F. 2006. Introduction to Stochastic Processes. Chapman & Hall, Boca Raton, FL.
dc.identifier.citedreferenceLei, Y., S. Jasin. 2016. Real‐time dynamic pricing for revenue management with reusable resources and deterministic service time requirements. Working paper, University of Michigan, Ann Arbor, MI. Available at https://ssrn.com/abstract=2816718 (accessed date August 1, 2016).
dc.identifier.citedreferenceLevi, R., A. Radovanovic. 2010. Provably near‐optimal LP‐based policies for revenue management in systems with reusable resources. Oper. Res. 58 ( 2 ): 503 – 507.
dc.identifier.citedreferenceLevi, R., C. Shi. 2015. Dynamic allocation problems in loss network systems with advanced reservation. Working paper, University of Michigan. Available at arXiv:1505.03774.
dc.identifier.citedreferenceLouth, G., M. Mitzenmacher, F. Kelly. 1994. Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints. Theoret. Comput. Sci. 125: 45 – 59.
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
poms12672_am.pdf
Size:
881.2KB
Format:
PDF
View/Open
Name:
poms12672.pdf
Size:
525.6KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.