Scheduling on a Stochastic Number of Machines
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929430679519232 |
|---|---|
| author | Buchem, Moritz Eberle, Franziska Rosado, Hugo Kooki Kasuya Schewior, Kevin Wiese, Andreas |
| author_facet | Buchem, Moritz Eberle, Franziska Rosado, Hugo Kooki Kasuya Schewior, Kevin Wiese, Andreas |
| contents | We consider a new scheduling problem on parallel identical machines in which the number of machines is initially not known, but it follows a given probability distribution. Only after all jobs are assigned to a given number of bags, the actual number of machines is revealed. Subsequently, the jobs need to be assigned to the machines without splitting the bags. This is the stochastic version of a related problem introduced by Stein and Zhong [SODA 2018, TALG 2020] and it is, for example, motivated by bundling jobs that need to be scheduled by data centers. We present two PTASs for the stochastic setting, computing job-to-bag assignments that (i) minimize the expected maximum machine load and (ii) maximize the expected minimum machine load (like in the Santa Claus problem), respectively. The former result follows by careful enumeration combined with known PTASs. For the latter result, we introduce an intricate dynamic program that we apply to a suitably rounded instance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_15737 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Scheduling on a Stochastic Number of Machines Buchem, Moritz Eberle, Franziska Rosado, Hugo Kooki Kasuya Schewior, Kevin Wiese, Andreas Data Structures and Algorithms We consider a new scheduling problem on parallel identical machines in which the number of machines is initially not known, but it follows a given probability distribution. Only after all jobs are assigned to a given number of bags, the actual number of machines is revealed. Subsequently, the jobs need to be assigned to the machines without splitting the bags. This is the stochastic version of a related problem introduced by Stein and Zhong [SODA 2018, TALG 2020] and it is, for example, motivated by bundling jobs that need to be scheduled by data centers. We present two PTASs for the stochastic setting, computing job-to-bag assignments that (i) minimize the expected maximum machine load and (ii) maximize the expected minimum machine load (like in the Santa Claus problem), respectively. The former result follows by careful enumeration combined with known PTASs. For the latter result, we introduce an intricate dynamic program that we apply to a suitably rounded instance. |
| title | Scheduling on a Stochastic Number of Machines |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2407.15737 |