Stochastic Load Balancing on Unrelated Machines
Lists
Only you see this
Abstract
We consider the problem of makespan minimization on unrelated machines when job sizes are stochastic. The goal is to find a fixed assignment of jobs to machines, to minimize the expected value of t...
BibTeX
@inproceedings{gupta2018stochastic,
author = {Anupam Gupta and Amit Kumar and Viswanath Nagarajan and Xiangkun Shen},
title = {{Stochastic Load Balancing on Unrelated Machines}},
booktitle = {SODA},
year = {2018},
doi = {10.1137/1.9781611975031.83},
}| Scheduling on a Stochastic Number of Machines | Approx/random · 2024 |
| Configuration Balancing for Stochastic Requests | arXiv · 2022 |
| Minimizing Completion Times for Stochastic Jobs via Batched Free Times | arXiv · 2022 |
| Online Load Balancing for Related Machines | arXiv · 2017 |
| Stochastic Online Scheduling on Unrelated Machines | arXiv · 2017 |
| Stochastic makespan minimization in structured set systems | arXiv · 2020 |