How to Maximize Efficiency in Systems with Exhausted Workers
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908295911964672 |
|---|---|
| author | Sariisik, Elif Beray Bastopcu, Melih Akar, Nail Ulukus, Sennur |
| author_facet | Sariisik, Elif Beray Bastopcu, Melih Akar, Nail Ulukus, Sennur |
| contents | We consider the problem of assigning tasks efficiently to a set of workers that can exhaust themselves as a result of processing tasks. If a worker is exhausted, it will take a longer time to recover. To model efficiency of workers with exhaustion, we use a continuous-time Markov chain (CTMC). By taking samples from the internal states of the workers, the source assigns tasks to the workers when they are found to be in their efficient states. We consider two different settings where (i) the source can assign tasks to the workers only when they are in their most efficient state, and (ii) it can assign tasks to workers when they are also moderately efficient in spite of a potentially reduced success probability. In the former case, we find the optimal policy to be a threshold-based sampling policy where the thresholds depend on the workers' recovery and exhaustion rates. In the latter case, we solve a non-convex sum-of-ratios problem using a branch-and-bound approach which performs well compared with the globally optimal solution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_01186 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | How to Maximize Efficiency in Systems with Exhausted Workers Sariisik, Elif Beray Bastopcu, Melih Akar, Nail Ulukus, Sennur Information Theory Networking and Internet Architecture Systems and Control Optimization and Control We consider the problem of assigning tasks efficiently to a set of workers that can exhaust themselves as a result of processing tasks. If a worker is exhausted, it will take a longer time to recover. To model efficiency of workers with exhaustion, we use a continuous-time Markov chain (CTMC). By taking samples from the internal states of the workers, the source assigns tasks to the workers when they are found to be in their efficient states. We consider two different settings where (i) the source can assign tasks to the workers only when they are in their most efficient state, and (ii) it can assign tasks to workers when they are also moderately efficient in spite of a potentially reduced success probability. In the former case, we find the optimal policy to be a threshold-based sampling policy where the thresholds depend on the workers' recovery and exhaustion rates. In the latter case, we solve a non-convex sum-of-ratios problem using a branch-and-bound approach which performs well compared with the globally optimal solution. |
| title | How to Maximize Efficiency in Systems with Exhausted Workers |
| topic | Information Theory Networking and Internet Architecture Systems and Control Optimization and Control |
| url | https://arxiv.org/abs/2504.01186 |