scholarly journals Research on the Task Assignment Problem with Maximum Benefits in Volunteer Computing Platforms

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 862
Author(s):  
Ling Xu ◽  
Jianzhong Qiao ◽  
Shukuan Lin ◽  
Xiaowei Wang
Keyword(s):  
Assignment Problem ◽  
Low Cost ◽  
Task Assignment ◽  
Task Completion ◽  
Volunteer Computing ◽  
Computing Services ◽  
Pruning Strategy ◽  
Computing Platforms ◽  
Deadline Constraints ◽  
Task Assignment Problem

As a type of distributed computing, volunteer computing (VC) has provided unlimited computing capacity at a low cost in recent decades. The architecture of most volunteer computing platforms (VCPs) is a master–worker model, which defines a master–slave relationship. Therefore, VCPs can be considered asymmetric multiprocessing systems (AMSs). As AMSs, VCPs are very promising for providing computing services for users. Users can submit tasks with deadline constraints to the VCPs. If the tasks are completed within their deadlines, VCPs will obtain the benefits. For this application scenario, this paper proposes a new task assignment problem with the maximum benefits in VCPs for the first time. To address the problem, we first proposed a list-based task assignment (LTA) strategy, and we proved that the LTA strategy could complete the task with a deadline constraint as soon as possible. Then, based on the LTA strategy, we proposed a maximum benefit scheduling (MBS) algorithm, which aimed at maximizing the benefits of VCPs. The MBS algorithm determined the acceptable tasks using a pruning strategy. Finally, the experiment results show that our proposed algorithm is more effective than current algorithms in the aspects of benefits, task acceptance rate and task completion rate.

scholarly journals The Task Assignment of Vehicles for a Production Company

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 551 ◽  
Author(s):  
Marianna Jacyna ◽  
Mariusz Izdebski ◽  
Emilian Szczepański ◽  
Paweł Gołda
Keyword(s):  
Assignment Problem ◽  
High Efficiency ◽  
Task Assignment ◽  
Task Completion ◽  
Manufacturing Enterprises ◽  
Transition Costs ◽  
Decision Variables ◽  
Criterion Functions ◽  
Production Company ◽  
Task Assignment Problem

The article investigates the problem of task assignment of vehicles for a production company. The presented problem is a complex decision-making issue which has not been analyzed in the literature before. Two stages must be passed through in order to solve the task assignment problem of the vehicles for the production company. The first stage is to designate the tasks, the other one is to determine the number of the vehicles that is needed to perform these tasks. The task in the analyzed problem is defined as transporting the cargo from the suppliers to the warehouses and from the warehouses to the production company. The number of the tasks depends on the type of the vehicle which carries out a given task. In order to solve the presented problem, the mathematical model has been developed, i.e., decision variables, constraints, and criterion functions. There are three types of decision variables occurring in the model, which means that this problem is quite complex. The first type of the decision variables determines the volume of the cargo which flows among the facilities on a given working day, the second type of the decision variables determines the use of a given type of the vehicle in the task, and the third type of the decision variables determines the number of the vehicles which perform the task. The criterion functions take the following form: the fuel consumption costs, the transition costs of the cargo via the warehouses, the purchase costs of the cargo, and the task completion time. In order to solve the task assignment problem of the vehicles, a genetic algorithm has been developed. The proposed method of task assignment solution is unique due to the coding method of individuals and related recombination procedures. The construction stages of this algorithm are presented. The algorithm has been verified by the use of the real input data. The developed model and method of its solution are unique in the application to the service of manufacturing enterprises. Due to the high efficiency and multi-aspect approach, it can be applied in enterprises of various industries as support for decision-makers in the optimization of resources.

Quadratic Convex Reformulation for Solving Task Assignment Problem with Continuous Hopfield Network

2021 ◽  
Author(s):  
Youssef Hami ◽  
Chakir Loqman
Keyword(s):  
Assignment Problem ◽  
Optimal Allocation ◽  
Task Assignment ◽  
Hopfield Network ◽  
Quadratic Program ◽  
Convex Objective Function ◽  
Calculation Results ◽  
Quadratic Convex Reformulation ◽  
Task Assignment Problem ◽  
Theoretical Results

This research is an optimal allocation of tasks to processors in order to minimize the total costs of execution and communication. This problem is called the Task Assignment Problem (TAP) with nonuniform communication costs. To solve the latter, the first step concerns the formulation of the problem by an equivalent zero-one quadratic program with a convex objective function using a convexification technique, based on the smallest eigenvalue. The second step concerns the application of the Continuous Hopfield Network (CHN) to solve the obtained problem. The calculation results are presented for the instances from the literature, compared to solutions obtained both the CPLEX solver and by the heuristic genetic algorithm, and show an improvement in the results obtained by applying only the CHN algorithm. We can see that the proposed approach evaluates the efficiency of the theoretical results and achieves the optimal solutions in a short calculation time.

scholarly journals Multi-UAV Rapid-Assessment Task-Assignment Problem in a Post-Earthquake Scenario

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 74542-74557 ◽  
Author(s):  
Moning Zhu ◽  
Xiaoxia Du ◽  
Xuehua Zhang ◽  
He Luo ◽  
Guoqiang Wang
Keyword(s):  
Assignment Problem ◽  
Rapid Assessment ◽  
Task Assignment ◽  
Earthquake Scenario ◽  
Assessment Task ◽  
Task Assignment Problem ◽  
Multi Uav
Sign in / Sign up

Export Citation Format

Share Document