.png){kind=icon}
返回
Compact Scheduling for Task Graph Oriented Mobile Crowdsourcing
.png){kind=icon}
OA
AI
DOI：10.1109/TMC.2020.3040007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the proliferation of increasingly powerful mobile devices and wireless networks, mobile crowdsourcing has emerged as a novel service paradigm. It enables crowd workers to take over outsourced location-dependent tasks, and has attracted much attention from both research communities and industries. In this paper, we consider a mobile crowdsourcing scenario, where a mobile crowdsourcing task is too complex (e.g., post-earthquake recovery, citywide package delivery) but can be divided into a number of easier subtasks, which have interdependency between them. Under this scenario, we investigate an important problem, namely task graph scheduling in mobile crowdsourcing (TGS-MC), which seeks to optimize a compact scheduling, such that the task completion time (i.e., makespan) and overall idle time are simultaneously minimized with the consideration of worker reliability. We analyze the complexity and NP-complete of the TGS-MC problem, and propose two heuristic approaches, including BFS-based dynamic priority scheduling BFSPriD algorithm, and an evolutionary multitasking-based EMTTSch algorithm, to solve our problem from local and global optimization perspective, respectively. We conduct extensive evaluation using two real-world data sets, and demonstrate superiority of our proposed approaches.
Keyword:
Mobile computing
Mobile crowdsourcing
task schedule
directed acyclic graph(DAG)
makespan
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.9K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容