Abstract
Many applications supported by the crowdsourcing are subject to delay constraints, and a real time result returned with a better partial fulfillment is preferable to the complement with delay latency. However, existing task assignment algorithms that only consider the case of full completion may not perform well. In this paper, we investigate the optimal online task assignment without knowledge about future task arrivals, which makes it tradeoff to assign high utility task with large deadline or less utility but more urgent task. The problem of computing optimal assignment for deadline aware tasks is formalized as an integer optimization problem. A dynamic programming based online algorithm for finding the optimal strategy for task assignment subject to delay constraints is proposed. And the time complexity of the algorithm is O(maxia#x03B5;{1, , n}{ri}nT), where ri is the total number of subtasks of task Ti, n is the number of total tasks, T is the deadline constraint. Experimental results show that the proposed algorithms have better performance in utility gain.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
