Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.26129 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912984921538560 |
|---|---|
| author | Chen, Chi-Yeh |
| author_facet | Chen, Chi-Yeh |
| contents | This paper addresses the scheduling problem for unrelated crowd workers in mobile social networks, where the required service time for each task varies among the assigned crowd workers. The goal is to minimize the total weighted completion time of all tasks. First, in an environment with identical crowd workers, we improve the approximation ratio of the Largest-Ratio-First (LRF) scheduling algorithm and provide an updated competitive ratio for its online version. Next, for the unrelated crowd workers environment, we introduce a randomized approximation algorithm that achieves an expected approximation ratio of 1.45. This result improves upon the 1.5-approximation ratio reported in our previous work. We also present a derandomization method for this algorithm. Furthermore, to improve computational efficiency, we propose an algorithm that leverages the property that the optimal schedule on a single crowd worker arranges tasks in non-increasing order by their Smith ratios. Experimental results demonstrate that our proposed method outperforms three variants of the LRF algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_26129 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks Chen, Chi-Yeh Data Structures and Algorithms This paper addresses the scheduling problem for unrelated crowd workers in mobile social networks, where the required service time for each task varies among the assigned crowd workers. The goal is to minimize the total weighted completion time of all tasks. First, in an environment with identical crowd workers, we improve the approximation ratio of the Largest-Ratio-First (LRF) scheduling algorithm and provide an updated competitive ratio for its online version. Next, for the unrelated crowd workers environment, we introduce a randomized approximation algorithm that achieves an expected approximation ratio of 1.45. This result improves upon the 1.5-approximation ratio reported in our previous work. We also present a derandomization method for this algorithm. Furthermore, to improve computational efficiency, we propose an algorithm that leverages the property that the optimal schedule on a single crowd worker arranges tasks in non-increasing order by their Smith ratios. Experimental results demonstrate that our proposed method outperforms three variants of the LRF algorithm. |
| title | Improved Algorithms for Unrelated Crowd Worker Scheduling in Mobile Social Networks |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2603.26129 |