Heuristics for product-line design using conjoint analysis
Management Science
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Throughput maximization of real-time scheduling with batching
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dependent Rounding in Bipartite Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling broadcasts with deadlines
Theoretical Computer Science - Special papers from: COCOON 2003
A Method for Staffing Large Call Centers Based on Stochastic Fluid Models
Manufacturing & Service Operations Management
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Queueing Systems: Theory and Applications
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Product Line Selection and Pricing with Modularity in Design
Manufacturing & Service Operations Management
Downlink Wireless Packet Scheduling with Deadlines
IEEE Transactions on Mobile Computing
Building Efficient Product Portfolios at John Deere and Company
Operations Research
Optimal downlink scheduling policies for slotted wireless time-varying channels
IEEE Transactions on Wireless Communications
Wireless scheduling with hybrid ARQ
IEEE Transactions on Wireless Communications
Rate-distortion optimized streaming of packetized media
IEEE Transactions on Multimedia
Scheduling algorithms for broadcasting media with multiple distortion measures
IEEE Transactions on Wireless Communications
Adaptive submodularity: theory and applications in active learning and stochastic optimization
Journal of Artificial Intelligence Research
Optimizing Intensive Care Unit Discharge Decisions with Patient Readmissions
Operations Research
Hi-index | 0.00 |
This paper presents a general class of dynamic stochastic optimization problems we refer to as stochastic depletion problems. A number of challenging dynamic optimization problems of practical interest are stochastic depletion problems. Optimal solutions for such problems are difficult to obtain, both from a pragmatic computational perspective as well as from a theoretical perspective. As such, simple heuristics are desirable. We isolate two simple properties that, if satisfied by a problem within this class, guarantee that a myopic policy incurs a performance loss of at most 50% relative to the optimal adaptive control policy for that problem. We are able to verify that these two properties are satisfied for several interesting families of stochastic depletion problems and, as a consequence, we identify computationally efficient approximations to optimal control policies for a number of interesting dynamic stochastic optimization problems.