Task Assignment and Personality

2022 ◽  
pp. 1795-1809
Author(s):  
Abdul Rehman Gilal ◽  
Muhammad Zahid Tunio ◽  
Ahmad Waqas ◽  
Malek Ahmad Almomani ◽  
Sajid Khan ◽  
...  
Keyword(s):  
Software Development ◽  
Task Assignment ◽  
Complicated Problem ◽  
Assignment Algorithm

An open call format of crowdsourcing software development (CSD) is harnessing potential, diverse, and unlimited people. But, several thousand solutions are being submitted at platform against each call. To select and match the submitted task with the appropriate worker and vice versa is still a complicated problem. Focusing the issue, this study proposes a task assignment algorithm (TAA) that will behave as an intermediate facilitator (at platform) between task (from requester) and solution (from worker). The algorithm will divide the tasks' list based on the developer's personality. In this way, we can save the time of both developers and platform by reducing the searching time.

Task Assignment and Personality

2019 ◽  
pp. 1-19
Author(s):  
Abdul Rehman Gilal ◽  
Muhammad Zahid Tunio ◽  
Ahmad Waqas ◽  
Malek Ahmad Almomani ◽  
Sajid Khan ◽  
...  
Keyword(s):  
Software Development ◽  
Task Assignment ◽  
Complicated Problem ◽  
Assignment Algorithm

An open call format of crowdsourcing software development (CSD) is harnessing potential, diverse, and unlimited people. But, several thousand solutions are being submitted at platform against each call. To select and match the submitted task with the appropriate worker and vice versa is still a complicated problem. Focusing the issue, this study proposes a task assignment algorithm (TAA) that will behave as an intermediate facilitator (at platform) between task (from requester) and solution (from worker). The algorithm will divide the tasks' list based on the developer's personality. In this way, we can save the time of both developers and platform by reducing the searching time.

scholarly journals Toward delay-tolerant multiple-unmanned aerial vehicle scheduling system using Multi-strategy Coevolution algorithm

2018 ◽  
Vol 10 (12) ◽  
pp. 168781401881523 ◽  
Author(s):  
Yohanes Khosiawan ◽  
Sebastian Scherer ◽  
Izabela Nielsen
Keyword(s):  
Particle Swarm Optimization ◽  
Differential Evolution ◽  
Unmanned Aerial Vehicle ◽  
Task Assignment ◽  
Computation Time ◽  
Task Sequence ◽  
Swarm Optimization ◽  
Assignment Algorithm ◽  
Aerial Vehicle ◽  
Delay Tolerant

Autonomous bridge inspection operations using unmanned aerial vehicles take multiple task assignments and constraints into account. To efficiently execute the operations, a schedule is required. Generating a cost optimum schedule of multiple-unmanned aerial vehicle operations is known to be Non-deterministic Polynomial-time (NP)-hard. This study approaches such a problem with heuristic-based algorithms to get a high-quality feasible solution in a short computation time. A constructive heuristic called Retractable Chain Task Assignment algorithm is presented to build an evaluable schedule from a task sequence. The task sequence representation is used during the search to perform seamless operations. Retractable Chain Task Assignment algorithm calculates and incorporates slack time to the schedule according to the properties of the task. The slack time acts as a cushion which makes the schedule delay-tolerant. This algorithm is incorporated with a metaheuristic algorithm called Multi-strategy Coevolution to search the solution space. The proposed algorithm is verified through numerical simulations, which take inputs from real flight test data. The obtained solutions are evaluated based on the makespan, battery consumption, computation time, and the robustness level of the schedules. The performance of Multi-strategy Coevolution is compared to Differential Evolution, Particle Swarm Optimization, and Differential Evolution–Fused Particle Swarm Optimization. The simulation results show that Multi-strategy Coevolution gives better objective values than the other algorithms.

A Dynamic-Programming-Styled Algorithm for a Class of Multi-Agent Optimal Task Assignment

2001 ◽  
Author(s):  
Guang Yang ◽  
Vikram Kapila ◽  
Ravi Vaidyanathan
Keyword(s):  
Dynamic Programming ◽  
Task Assignment ◽  
Research Activity ◽  
Spacecraft Formation ◽  
Assignment Algorithm ◽  
Decentralized Decision Making ◽  
Current Research Activity ◽  
Multi Agent ◽  
Global Optimal ◽  
Multiple Spacecraft

Abstract In this paper, we use a dynamic programming formulation to address a class of multi-agent task assignment problems that arise in the study of fuel optimal control of multiple agents. The fuel optimal multi-agent control is highly relevant to multiple spacecraft formation reconfiguration, an area of intense current research activity. Based on the recurrence relation derived from the celebrated principle of optimality, we develop an algorithm with a distributed computational architecture for the global optimal task assignment. In addition, we propose a communication protocol to facilitate decentralized decision making among agents. Illustrative studies are included to demonstrate the efficacy of the proposed multi-agent optimal task assignment algorithm.

Modelling a Deep Learning-Based Wireless Sensor Network Task Assignment Algorithm

2020 ◽  
pp. 84-109
Author(s):  
Titus Issac ◽  
Salaja Silas ◽  
Elijah Blessing Rajsingh
Keyword(s):  
Deep Learning ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Task Assignment ◽  
Human Interaction ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Feed Forward Neural Network ◽  
Functional Capabilities ◽  
Assignment Algorithm

The 21st century is witnessing the emergence of a wide variety of wireless sensor network (WSN) applications ranging from simple environmental monitoring to complex satellite monitoring applications. The advent of complex WSN applications has led to a massive transition in the development, functioning, and capabilities of wireless sensor nodes. The contemporary nodes have multi-functional capabilities enabling the heterogeneous WSN applications. The future of WSN task assignment envisions WSN to be heterogeneous network with minimal human interaction. This led to the investigative model of a deep learning-based task assignment algorithm. The algorithm employs a multilayer feed forward neural network (MLFFNN) trained by particle swarm optimization (PSO) for solving task assignment problem in a dynamic centralized heterogeneous WSN. The analyses include the study of hidden layers and effectiveness of the task assignment algorithms. The chapter would be highly beneficial to a wide range of audiences employing the machine and deep learning in WSN.

Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources

2016 ◽  
Vol 27 (5) ◽  
pp. 1303-1315 ◽  
Author(s):  
Chunhui Guo ◽  
Xiayu Hua ◽  
Hao Wu ◽  
Douglas Lautner ◽  
Shangping Ren
Keyword(s):  
Task Assignment ◽  
Periodic Task ◽  
Assignment Algorithm

scholarly journals Task Assignment Algorithm Based on Trust in Volunteer Computing Platforms

Information ◽  
2019 ◽  
Vol 10 (7) ◽  
pp. 244 ◽  
Author(s):  
Ling Xu ◽  
Jianzhong Qiao ◽  
Shukuan Lin ◽  
Ruihua Qi
Keyword(s):  
Completion Time ◽  
Fuzzy Model ◽  
Task Assignment ◽  
Experimental Results ◽  
Volunteer Computing ◽  
Time Interval ◽  
Reliability Model ◽  
Assignment Algorithm ◽  
Computing Platforms ◽  
Task Segmentation

In volunteer computing (VC), the expected availability time and the actual availability time provided by volunteer nodes (VNs) are usually inconsistent. Scheduling tasks with precedence constraints in VC under this situation is a new challenge. In this paper, we propose two novel task assignment algorithms to minimize completion time (makespan) by a flexible task assignment. Firstly, this paper proposes a reliability model, which uses a simple fuzzy model to predict the time interval provided by a VN. This reliability model can reduce inconsistencies between the expected availability time and actual availability time. Secondly, based on the reliability model, this paper proposes an algorithm called EFTT (Earliest Finish Task based on Trust, EFTT), which can minimize makespan. However, EFTT may induce resource waste in task assignment. To make full use of computing resources and reduce task segmentation rate, an algorithm IEFTT (improved earliest finish task based on trust, IEFTT) is further proposed. Finally, experimental results verify the efficiency of the proposed algorithms.

Sign in / Sign up

Export Citation Format

Share Document