Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems

References

• Bar-Noy A., Guha S., Katz Y., Naor J., Schieber B., Shachnai H. Throughput maximization of real-time scheduling with batching. Proc. 13th SODA (2002) San Francisco:742–751Google Scholar
• Bassamboo A., Harrison J. M., Zeevi A. Design and control of a large call center: Asymptotic analysis of an LP-based method. Oper. Res. (2006) 54:419–435Link, Google Scholar
• Bassamboo A., Harrison J. M., Zeevi A. Dynamic routing and admission control in high volume service systems: Asymptotic analysis via multi-scale fluid limits. Queueing Systems Theory Appl. (2006) 51:249–285Crossref, Google Scholar
• Buyukkoc C., Varaiya P., Walrand J. The c − μ rule revisited. Adv. Appl. Probab. (1985) 17(1):237–238Crossref, Google Scholar
• Calinescu G., Chekuri G., Pál M., Vondrák J. Maximizing a submodular set function subject to a matroid constraint. Proc. 12th IPCO (2007) Ithaca, NY:182–196Google Scholar
• Chou P. A., Miao Z. Rate-distortion optimized streaming of packetized media. IEEE Trans. Multimedia (2006) 8(2):390–404Crossref, Google Scholar
• Dua A., Bambos N. Downlink scheduling of heterogeneous traffic. Proc. IEEE ICC (2006) 11Istanbul, Turkey:5252–5257Google Scholar
• Dua A., Bambos N. Joint power allocation and scheduling for deadline constrained wireless traffic. Proc. IEEE Globecom (2006) November 2006:1–5Google Scholar
• Dua A., Bambos N. Downlink wireless packet scheduling with deadlines. IEEE Trans. Mobile Comput. (2007) 6(12):1410–1425Crossref, Google Scholar
• Eryilmaz A., Srikant R., Perkins J. R. Stable scheduling policies for fading wireless channels. IEEE/ACM Trans. Netw. (2005) 13(2):411–424Crossref, Google Scholar
• Fisher M. L., Nemhauser G. L., Wolsey L. A. An analysis of approximations for maximizing submodular set functions—II. Math. Programming Study (1978) 8:73–87Crossref, Google Scholar
• Fleischer L. K., Goemans M. X., Mirrokni V., Sviridenko M. Tight approximation algorithms for maximizing general assignment problems. Proc. 17th SODA (2006) Miami:611–620Google Scholar
• Frank R. E., Massy W. F., Wind Y.Market Segmentation (1972) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Gandhi T., Khuller S., Parthasarathy S., Srinivasan A. Dependent rounding in bipartite graphs. Proc. 43rd FOCS (2002) Vancouver, B.C., Canada:323–332Google Scholar
• Goundan P. R., Schulz A. S. Revisiting the greedy approach to submodular set function maximization. (2007) . Working paper, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Harrison J. M., Zeevi A. A method for staffing large call centers using stochastic fluid models. Manufacturing Service Oper. Management (2005) 7:20–36Link, Google Scholar
• Hopp W. J., Xu X. Product line selection and pricing with modularity. Manufacturing Service Oper. Management (2005) 7(3):172–187Link, Google Scholar
• Huang J., Berry R., Honig M. Wireless scheduling with hybrid ARQs. IEEE Trans. Wireless Comm. (2005) 4(November 6):2801–2810Crossref, Google Scholar
• Jansen K., Zhang G. On rectangle packing: Maximizing benefits. Proc. 17th SODA (2004) New Orleans:204–213Google Scholar
• Kim J.-H., Chwa K.-Y. Scheduling broadcasts with deadlines. Theoretical Comput. Sci. (2004) 325(3):479–488Crossref, Google Scholar
• Kohli R., Sukumar R. Heuristics for product-line design using conjoint analysis. Management Sci. (1990) 36(12):1464–1478Link, Google Scholar
• Moorthy K. S. Market segmentation, self-selection, and product line design. Marketing Sci. (1984) 3(4):288–307Link, Google Scholar
• Nemhauser G. L., Wolsey L. A., Fisher M. L. An analysis of approximations for maximizing submodular set functions—I. Math. Programming (1978) 14:265–294Crossref, Google Scholar
• Pigou A. C.The Economics of Welfare (1978) (AMS Press, Inc., NY) Google Scholar
• Ren T., Koutsopoulos I., Tassiulas L. QoS provisioning for real-time traffic in wireless packet networks. Proc. IEEE GLOBECOM (2002) 2(November):1673–1677Google Scholar
• Shmoys D. B., Tardos E. An approximation algorithm for the generalized assignment problem. Math. Programming (1993) 62(3):461–474Crossref, Google Scholar
• Su C.-J., Tassiulas L. Broadcast scheduling for information distribution. Proc. IEEE INFOCOM (1997) 1(April):109–117Google Scholar
• Tsibonis V., Geogiadis L. Optimal downlink scheduling policies for slotted wireless time-varying channels. IEEE Trans. Wireless Comm. (2005) 4(4):1808–1817Crossref, Google Scholar
• van Mieghem J. A. Dynamic scheduling with convex delay costs: The generalized c | μ rule. Ann. Appl. Probab. (1995) 5(3):809–833Crossref, Google Scholar
• van Ryzin G. J., Mahajan S. On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. (1999) 45(11):1496–1509Link, Google Scholar
• Yunes T. H., Napolitano D., Scheller-Wolf A., Tayur S. Building efficient product portfolios at John Deere and Company. Oper. Res. (2007) 55(4):615–629Link, Google Scholar