Task allocation method and device, computer equipment and readable storage medium

Abstract

The invention provides a task allocation method and device, computer equipment and a readable storage medium, and the method comprises the steps: carrying out the sorting of original processors according to the number of held tasks, forming a processor queue, and always allocating the number of tasks to a newly-added processor from the original processor with the largest number of held tasks according to the processor queue. When the tasks are allocated to the newly added processors, the task number is always allocated from the original processor with the largest task number, and a fair allocation effect can be achieved; meanwhile, after the task number is allocated once, the first original processor only needs to be compared with the adjacent second original processor in the processor queue, the specific original processor with the largest task number can be determined, and the performance and rapidity of the task allocation process are both considered.

Description

technical field [0001] The present application relates to the field of data processing, in particular to a task allocation method, device, computer equipment and readable storage medium. Background technique [0002] In human resource management or other task allocation management, it is often necessary to assign multiple tasks to multiple people. If tasks are not evenly allocated, it is easy to cause complaints from employees and lead to a decrease in work efficiency. In the prior art, there is a task allocation method using reverse greedy or ascending order to assign multiple tasks to multiple different processors as quickly and efficiently as possible. However, in the current prior art, a new When dealing with people, there is no better way to balance performance and averageness on how to allocate tasks to new processors in the fairest way. Contents of the invention [0003] The main purpose of the present application is to provide a task allocation method, device, com...

AI Technical Summary

Problems solved by technology

[0002] In human resource management or other task assignment management, it is often necessary to assign multiple tasks to multiple people. If the tasks are not evenly distributed, it is easy to cause complaints from employees and lead to a decrease in work efficiency

In the prior art, there is a task allocation method using the reverse greedy or ascending order method to assign multiple tasks to multiple different processors as quickly and efficiently as possible. However, in the current prior art, a new When dealing with people, there is no better way to balance performance and averageness on how to allocate tasks to new processors in the fairest way

Images