Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources

References

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