Pricing and capacity rationing for rentals with uncertain durations

Management Science

Volumn 53, Issue 3, 2007, Pages 390-407

  Gans, Noah ^a   Savin, Sergei ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Dynamic programming; Rentals; Revenue management; Services

Indexed keywords

RENTALS; REVENUE MANAGEMENT; SERVICES;

COSTS; EARNINGS; NUMERICAL METHODS; PUBLIC POLICY; QUALITY OF SERVICE; STOCHASTIC CONTROL SYSTEMS;

UNCERTAIN SYSTEMS;

EID: 34247471155     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1060.0651     Document Type: Article

References (36)

1. Alstrup, J., S. Boas, O. B. G. Madsen, R. V. V. Vidal. 1986. Booking policy for flights with two types of passengers. Eur. J. Oper. Res. 27(3) 274-288.
2. Altman, E., T. Jimenez, G. Koole. 2001. On optimal call admission control. IEEE Trans. Comm. 49(9) 1659-1668.
3. Belobaba, P. P. 1989. Application of a probabilistic decision model to airline seat inventory control. Oper. Res. 37(2) 183-197.
4. Bitran, G. R., S. M. Gilbert. 1996. Managing hotel reservations with uncertain arrivals. Oper. Res. 44(1) 35-49.
5. Borst, S., A. Mandelbaum, M. I. Reiman. 2004. Dimensioning large call centers. Oper. Res. 52(1) 17-34.
6. Brumelle, S. L., J. I. McGill. 1993. Airline seat allocation with multiple nested fare classes. Oper. Res. 41(1) 127-137.
7. Gans, N., G. Koole, A. Mandelbaum. 2003. Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2) 79-141.
8. Gayon, J.-P., I. Talay-Deǧirmenci, F. Karaesmen, E. L. Örmeci. 2004. Dynamic pricing and replenishment in a production-inventory system with Markov-modulated demand. Working paper, Laboratoire Génie Industriel, École Centrale Paris, Châtenay-Malabry, France.
9. Jagerman, D. L. 1974. Some properties of the Erlang loss function. Bell Systems Tech. J. 53(3) 525-551.
10. Kelley, F. P. 1997. Charging and rate control for elastic traffic. Eur. Trans. Telecomm. 8 33-37.
11. Kelley, F. P., A. K. Maullo, D. K. H. Tan. 1998. Rate control for communication networks: Shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49(3) 237-252.
12. Kleywegt, A. J., J. D. Papastavrou. 1998. The dynamic and stochastic knapsack problem. Oper. Res. 46(1) 17-35.
13. Ladany, S. 1977. Bayesian dynamic operating rules for optimal hotel reservation. Z. Oper. Res. 21(6) B165-B176.
14. Lewis, M. E., H. Ayhan, R. D. Foley. 1999. Bias optimality in a queue with admission control. Probab. Engrg. Inform. Sci. 13(3) 309-327.
15. Liberman, V., U. Yechiali. 1978. On the hotel overbooking problem: An inventory system with stochastic cancellations. Management Sci. 24(11) 1117-1126.
16. Lippman, S. 1975. Applying a new device in the optimization of exponential queueing systems. Oper. Res. 23(4) 687-710.
17. Littlewood, K. 1972. Forecasting and control of passenger bookings. AGIFORS Sympos. Proc. 12 95-117.
18. Low, D. W. 1974. Optimal dynamic pricing policies for an M/M/s queue. Oper. Res. 22(3) 545-561.
19. Maglaras, C., A. Zeevi. 2005. Pricing and design of differentiated services: Approximate analysis and structural insights. Oper. Res. 53(2) 242-262.
20. Miller, B. 1969. A queueing reward system with several customer classes. Management Sci. 16(3) 234-245.
21. Örmeci, E. L., A. N. Burnetas. 2004. Admission control with batch arrivals. Oper. Res. Lett. 32(5) 448-454.
22. Örmeci, E. L., A. N. Burnetas. 2005. Dynamic admission control for loss systems with batch arrivals. Adv. Appl. Probab. 37(4) 915-937.
23. Örmeci, E. L., J. van der Wal. 2006. Admission policies for a two class loss system with general interarrival times. Stochastic Models 22(1) 37-53.
24. Örmeci, E. L., A. N. Burnetas, H. Emmons. 2002. Admission policies for a two-class loss system based on customer offers. IIE Trans. 34(9) 813-822.
25. Örmeci, E. L., A. N. Burnetas, J. van der Wal. 2001. Admission policies for a two class loss system. Stochastic Models 17(4) 513-540.
26. Paschalidis, C. P., J. N. Tsitsiklis. 2000. Congestion-dependent pricing of network services. IEEE/ACM Trans. Networking 8(2) 171-184.
27. Porteus, E. 1982. Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs. J. Optim. Theory Appl. 36(3) 419-432.
28. Puterman, M. L. 1994. Discrete Stochastic Dynamic Programming. John Wiley and Sons, New Jersey.
29. Ross, K. W., D. H. K. Tsang. 1989. The stochastic knapsack problem. IEEE Trans. Comm. 37(7) 740-747.
30. Ross, K. W., D. D. Yao. 1990. Monotonicity properties for the stochastic knapsack. IEEE Trans. Info. Theory 36(5) 1173-1179.
31. Ross, S. M. 1996. Stochastic Processes. John Wiley and Sons, New Jersey.
32. Rothstein, M. 1974. Hotel overbooking as a Markovian sequential decision process. Decision Sci. 5 389-404.
33. Savin, S., M. A. Cohen, N. Gans, Z. Katalan. 2005. Capacity management in rental businesses with two customer bases. Oper. Res. 53(4) 617-631.
34. Williams, F. E. 1977. Decision theory and the innkeeper: An approach for setting hotel reservation policy. Interfaces 7(4) 18-30.
35. Yoon, S., M. E. Lewis. 2004. Optimal pricing and admission control in a queueing system with periodically varying parameters. QUESTA 47(3) 177-199.
36. Zhao, W., Y. S. Zheng. 2000. Optimal dynamic pricing for perishable assets with nonhomogeneous demand. Management Sci. 46(3) 375-388.