Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Approximation results in parallel machines stochastic scheduling
Annals of Operations Research
Turnpike optimality of Smith's Rule in parallel machines stochastic scheduling
Mathematics of Operations Research
Randomized algorithms
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Computing equilibria for congestion games with (im)perfect information
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Schedulability analysis of applications with stochastic task execution times
ACM Transactions on Embedded Computing Systems (TECS)
Parallel scheduling of complex dags under uncertainty
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Asking the right questions: model-driven optimization using probes
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms of video replication and placement on a cluster of streaming servers
Journal of Network and Computer Applications
Approximation algorithms for multiprocessor scheduling under uncertainty
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for budgeted learning problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Model-driven optimization using adaptive probes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The ratio index for budgeted learning, with applications
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Exceeding expectations and clustering uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Stochastic models for budget optimization in search-based advertising
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
How to probe for an extreme value
ACM Transactions on Algorithms (TALG)
On approximations for multiple multidimensional stochastic knapsacks
ACM SIGMETRICS Performance Evaluation Review
Approximation algorithms for reliable stochastic combinatorial optimization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A case for on-machine load balancing
Journal of Parallel and Distributed Computing
TECHNICAL NOTE---The Adaptive Knapsack Problem with Stochastic Rewards
Operations Research
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation results for stochastic knapsack problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the International Conference on Computer-Aided Design
Communication: The stochastic generalized bin packing problem
Discrete Applied Mathematics
Exploring online virtual networks mapping with stochastic bandwidth demand in multi-datacenter
Photonic Network Communications
A PTAS for the chance-constrained knapsack problem with random item sizes
Operations Research Letters
Sales-force performance analytics and optimization
IBM Journal of Research and Development
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Note: Adaptivity in the stochastic blackjack knapsack problem
Theoretical Computer Science
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
Discrete Applied Mathematics
| Hi-index | 0.00 |
We study the problems of makespan minimization (load balancing), knapsack, and bin packing when the jobs have stochastic processing requirements or sizes. If the jobs are all Poisson, we present a two approximation for the first problem using Graham's rule, and observe that polynomial time approximation schemes can be obtained for the last two problems. If the jobs are all exponential, we present polynomial time approximation schemes for all three problems. We also obtain quasi-polynomial time approximation schemes for the last two problems if the jobs are Bernoulli variables.