Provably near-optimal LP-based policies for revenue management in systems with reusable resources

Operations Research

Volumn 58, Issue 2, 2010, Pages 503-507

  Levi, Retsef ^a   Radovanović, Ana ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b GOOGLE INC   (United States)

Author keywords

Algorithms; Loss networks; Revenue management

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CONTROL POLICY; EMERGING APPLICATIONS; LINEAR PROGRAMS; LOSS NETWORKS; OPTIMAL SOLUTIONS; PERFORMANCE GUARANTEES; RESERVATION POLICY; RESOURCE REQUIREMENTS; REVENUE MANAGEMENT; UPPER BOUND; WORKFORCE MANAGEMENT;

COMPUTER OPERATING PROCEDURES; OPTIMIZATION;

MANAGEMENT;

EID: 77951202701     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0714     Document Type: Article

References (23)

1. Adelman, D. 2006. A simple algebraic approximation to the Erlang loss system. Oper. Res. Lett. 36 484-491.
2. Adelman, D. 2007. Price-directed control of a closed logistics queueing network. Oper. Res. 55 1022-1038.
3. Burman, D. Y., J. P. Lehoczky, Y. Lim. 1984. Insensitivity of blocking probabilities in a circuit-switching network. J. Appl. Probab. 21 850-859.
4. Erlang, A. K. 1917. Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Elektrotkeknikeren 13 5-13.
5. Fan-Orzechowski, X., E. A. Feinberg. 2006. Optimality of randomized trunk reservation for a problem with a single constraint. Adv. Appl. Probab. 38 199-220.
6. Hunt, P. J., C. N. Laws. 1997. Optimization via trunk reservation in single resource loss systems under heavy traffic. Ann. Appl. Probab. 7 1058-1079.
7. Iyengar, G., K. Sigman. 2004. Exponential penalty function control of loss networks. Ann. Appl. Probab. 14 1698-1740.
8. Kaufman, J. S. 1981. Blocking in a shared resources environment. IEEE Trans. Comm. 29 1474-1481.
9. Kelly, F. P. 1979. Reversability and Stochastic Networks. John Wiley & Sons, Inc., New York.
10. Kelly, F. P. 1986. Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. 18 473-505.
11. Kelly, F. P. 1991. Effective bandwidths at multi-class queues. Queueing Systems 9 5-16.
12. Key, P. 1990. Optimal control and trunk reservation in loss networks. Probab. Engrg. Inform. Sci. 4 203-242.
13. Kumar, S., R. Srikant, P. R. Kumar. 1998. Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints. Queueing Systems 28 55-77. (Pubitemid 128367275)
14. Levi, R., A. Radovanović. 2007. Provably near-optimal LP-based policies for revenue management in systems with reusable resources. Technical Report 4702-4708, Massachusetts Institute of Technology, Sloan School of Management, Cambridge.
15. Louth, G., M. Mitzenmacher, F. Kelly. 1994. Computational complexity of loss networks. Theoret. Comput. Sci. 125 45-59.
16. Miller, B. 1969. A queueing reward system with several customer classes. Management Sci. 16 234-245.
17. Puhalskii, A. A., M. I. Reiman. 1998. A critically loaded multirate link with trunk reservation. Queueing Systems 28 157-190.
18. Ross, K., D. Tsang. 1989. The stochastic knapsack problem. IEEE Trans. Comm. 37 740-747.
19. Ross, K., D. Yao. 1990. Monotonicity properties for the stochastic knapsack. IEEE Trans. Inform. Theory 36 1173-1179.
20. Sevastyanov, B. A. 1957. An ergodic theorem for Markov processes and its application to telephone systems with refusals. Theory Probab. and Its Appl. 2 104-112.
21. Whitt, W. 1985. Blocking when service is required from several facilities simultaneously. AT&T Tech. J. 64 1807-1856.
22. Wolff, R. W. 1989. Stochastic Modeling and Theory of Queues. Prentice Hall, Englewood Cliffs, NJ.
23. Zachary, S. 1991. On blocking in loss networks. Adv. Appl. Probab. 23 355-372.