CN107092999B - Task processing method and device - Google Patents
Task processing method and device Download PDFInfo
- Publication number
- CN107092999B CN107092999B CN201610979473.XA CN201610979473A CN107092999B CN 107092999 B CN107092999 B CN 107092999B CN 201610979473 A CN201610979473 A CN 201610979473A CN 107092999 B CN107092999 B CN 107092999B
- Authority
- CN
- China
- Prior art keywords
- task
- processed
- processing
- distance
- tasks
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
Abstract
The embodiment of the invention provides a task processing method and device. In the embodiment of the invention, a plurality of tasks to be processed are obtained; acquiring a plurality of processing centers for processing tasks; and allocating at least one task to be processed for each acquired processing center. According to the method provided by the embodiment of the invention, the manual allocation of the to-be-processed personnel is not needed, the cost is lower, and when more to-be-processed tasks are obtained, all the to-be-processed tasks can be allocated to the processing center for processing in a short time, so that the allocation efficiency is higher, and the processing center can start processing the to-be-processed tasks allocated to the processing center in time.
Description
Technical Field
The embodiment of the invention relates to the technical field of computers, in particular to a task processing method and device.
Background
With the rapid development of the technology, people often order food on the network, and when the server receives an order sent by a terminal of a user, the order is distributed to delivery personnel so as to ensure that goods in the order can be delivered to the user on time.
In the prior art, at least one worker is provided in advance to manually assign orders to the distribution staff.
However, the inventor found that the manual distribution cost is high, when a large number of orders are received by the server in a short time and the number of orders to be distributed is large, the staff may not distribute all the orders to the distribution staff in a short time, the distribution efficiency is low, and it is not guaranteed that the goods can arrive in the hands of the users on time.
Disclosure of Invention
In order to overcome the problems in the related art, embodiments of the present invention provide a task processing method and apparatus.
According to a first aspect of the embodiments of the present invention, there is provided a task processing method applied to a server, the method including:
acquiring a plurality of tasks to be processed;
acquiring a plurality of processing centers for processing tasks;
distributing at least one task to be processed for each acquired processing center; the processing center is used for processing tasks.
Further, after the obtaining of the plurality of tasks to be processed, the method further includes:
and acquiring the task attribute of each task to be processed, wherein the task attribute at least comprises the quantity of resources required for processing the task to be processed.
Wherein, the allocating at least one task to be processed for each acquired processing center includes:
grouping the plurality of tasks to be processed according to the acquired task attributes, wherein the number of the tasks to be processed in each task group is smaller than a first preset number threshold, or the sum of the number of resources required for processing the tasks to be processed in each task group is smaller than a preset resource number threshold;
at least one task group is assigned to each acquired processing center.
Wherein, the grouping the plurality of tasks to be processed according to the acquired task attributes comprises:
respectively forming each task to be processed in the plurality of tasks to be processed into a task subgroup;
forming a task group by task subgroups, wherein the sum of resources occupied by tasks to be processed is greater than a preset number threshold;
in the rest task subgroups, respectively calculating the distance between every two task subgroups according to the task attributes of the tasks to be processed in the task subgroups;
responding to the situation that the sum of the number of resources required for processing the tasks to be processed in the two task sub-groups which are closest to each other is larger than a preset resource number threshold value, or the situation that the total number of the tasks to be processed in the two task sub-groups which are closest to each other is larger than a first preset number threshold value, and forming the two task sub-groups which are closest to each other into a task group;
and in response to the fact that the sum of the number of resources required for processing the tasks to be processed included in the two task subgroups closest to each other is smaller than or equal to a preset resource number threshold, or the total number of the tasks to be processed included in the two task subgroups closest to each other is smaller than or equal to a first preset number threshold, forming the two task subgroups closest to each other into a new task subgroup, returning to the remaining task subgroups, and calculating the distance between every two task subgroups according to the task attributes of the tasks to be processed included in the task subgroups.
Wherein the task attributes further include: position information of a task handler of the task to be processed and position information of a task requester of the task to be processed,
the step of respectively calculating the distance between every two task subgroups according to the task attributes of the tasks to be processed in the task subgroups comprises the following steps:
for any two task subgroups in the remaining task subgroups, calculating a first distance between a task processing party of a task to be processed included in a first task subgroup and a task processing party of a task to be processed included in a second task subgroup according to position information of the task processing party of each task to be processed included in the two task subgroups;
according to the position information of the task requester of each task to be processed in the two task subgroups, calculating a second distance between the task processor of the task to be processed in the first task subgroup and the task requester of the task to be processed in the second task subgroup;
and calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient.
Wherein, the calculating a first distance between a task processor of a task to be processed included in a first task subgroup and a task processor of a task to be processed included in a second task subgroup according to the position information of the task processor of each task to be processed included in the two task subgroups includes:
calculating a task processing party distance between the task processing party of each task to be processed in the first task subgroup and the task processing party of each task to be processed in the second task subgroup according to the position information of the task processing party of each task to be processed in the first task subgroup and the position information of the task processing party of each task to be processed in the second task subgroup;
and calculating the average value of all the obtained task processing party distances, and taking the average value as the first distance.
Wherein, the calculating a second distance between the task processing party of the task to be processed included in the first task subgroup and the task requesting party of the task to be processed included in the second task subgroup according to the position information of the task requesting party of each task to be processed included in the two task subgroups includes:
calculating a task requester distance between a task requester of each to-be-processed task in the first task subgroup and a task requester of each to-be-processed task in the second task subgroup according to the position information of the task requester of each to-be-processed task in the first task subgroup and the position information of the task requester of each to-be-processed task in the second task subgroup;
and calculating the average value of all the obtained task requester distances, and taking the average value as the second distance.
Wherein the calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient comprises:
calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient and the following formula;
S＝m*A+n*B；
in the above formula, S is a distance between the first task subgroup and the second task subgroup, m and n are both the preset coefficients, a is the first distance, and B is the second distance.
Wherein, the acquiring a plurality of processing centers for processing tasks includes:
and acquiring processing centers of which the number of the tasks being processed is less than a second preset number from a plurality of different processing centers which are preset.
Wherein the allocating at least one task group to each acquired processing center includes:
respectively acquiring current position information of each processing center;
for any task group, calculating the distance between each task group and each processing center according to the position information of the task processing party of each task to be processed and the position information of each processing center in the task group; and then distributing the task groups to the processing centers closest to the distance between the task groups so that the processing centers closest to the distance between the task groups process the tasks to be processed included in the task groups.
Wherein, the calculating the distance between each processing center and each task group according to the position information of each task processing party of each task to be processed and the position information of each processing center included in the task group includes:
responding to that only one task to be processed is included in the task group, and calculating the distance between the task processing party of the task to be processed included in the task group and the processing center according to the position information of the task processing party of the task to be processed included in the task group and the current position information of the processing center for any processing center, wherein the distance is used as the distance between the task group and the processing center;
and responding to the fact that the task group comprises a plurality of tasks to be processed, and for any processing center, calculating the average distance between the task processing party of each task to be processed and the processing center according to the position information of the task processing party of each task to be processed and the current position information of the processing center in the task group, and taking the average distance as the distance between the task group and the processing center.
According to a second aspect of the embodiments of the present invention, there is provided a task processing apparatus applied to a server, the apparatus including:
the first acquisition module is used for acquiring a plurality of tasks to be processed;
the second acquisition module is used for acquiring a plurality of processing centers for processing tasks;
the distribution module is used for distributing at least one task to be processed for each acquired processing center; the processing center is used for processing tasks.
Further, the apparatus further comprises:
and the third acquisition module is used for acquiring the task attribute of each task to be processed, wherein the task attribute at least comprises the quantity of resources required for processing the task to be processed.
Wherein the allocation module comprises:
the grouping submodule is used for grouping the plurality of tasks to be processed according to the acquired task attributes, wherein the number of the tasks to be processed in each task group is smaller than a first preset number threshold, or the sum of the number of resources required for processing the tasks to be processed in each task group is smaller than a preset resource number threshold;
and the distribution submodule is used for distributing at least one task group for each acquired processing center.
Wherein the grouping submodule includes:
the first composition unit is used for respectively composing each task to be processed in the plurality of tasks to be processed into a task subgroup;
the second composition unit is used for composing a task group by the task subgroups, wherein the total sum of resources occupied by the tasks to be processed is larger than a preset number threshold value;
the first computing unit is used for respectively computing the distance between every two task subgroups according to the task attributes of the tasks to be processed in the remaining task subgroups;
a third forming unit, configured to form one task group from the two task subgroups closest to the processing unit in response to that a sum of numbers of resources required to process the tasks to be processed included in the two task subgroups closest to the processing unit is greater than a preset resource number threshold, or that a total number of tasks to be processed included in the two task subgroups closest to the processing unit is greater than a first preset number threshold;
and a fourth composing unit, configured to, in response to that a sum of numbers of resources required to process the to-be-processed tasks included in the two task subgroups closest to each other is less than or equal to a preset resource number threshold, or that a total number of the to-be-processed tasks included in the two task subgroups closest to each other is less than or equal to a first preset number threshold, compose the two task subgroups closest to each other into a new task subgroup, return to the remaining task subgroups, and calculate distances between each two task subgroups according to task attributes of the to-be-processed tasks included in the task subgroups.
Wherein the task attributes further include: position information of a task handler of the task to be processed and position information of a task requester of the task to be processed,
the first calculation unit includes:
for any two task subgroups in the remaining task subgroups, a first calculating subunit is configured to calculate, according to location information of a task handler of each task to be processed included in the two task subgroups, a first distance between a task handler of the task to be processed included in a first task subgroup included in the two task subgroups and a task handler of the task to be processed included in a second task subgroup;
the second calculating subunit is configured to calculate, according to the position information of the task requester of each to-be-processed task included in the two task subgroups, a second distance between the task handler of the to-be-processed task included in the first task subgroup and the task requester of the to-be-processed task included in the second task subgroup;
and the third calculation subunit is used for calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient.
Wherein the first computing subunit is specifically configured to:
calculating a task processing party distance between the task processing party of each task to be processed in the first task subgroup and the task processing party of each task to be processed in the second task subgroup according to the position information of the task processing party of each task to be processed in the first task subgroup and the position information of the task processing party of each task to be processed in the second task subgroup;
and calculating the average value of all the obtained task processing party distances, and taking the average value as the first distance.
Wherein the second calculating subunit is specifically configured to:
calculating a task requester distance between a task requester of each to-be-processed task in the first task subgroup and a task requester of each to-be-processed task in the second task subgroup according to the position information of the task requester of each to-be-processed task in the first task subgroup and the position information of the task requester of each to-be-processed task in the second task subgroup;
and calculating the average value of all the obtained task requester distances, and taking the average value as the second distance.
Wherein the third computing subunit is specifically configured to:
calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient and the following formula;
S＝m*A+n*B；
in the above formula, S is a distance between the first task subgroup and the second task subgroup, m and n are both the preset coefficients, a is the first distance, and B is the second distance.
The second obtaining module is specifically configured to:
and acquiring processing centers of which the number of the tasks being processed is less than a second preset number from a plurality of different processing centers which are preset.
Wherein the allocation submodule comprises:
the acquisition unit is used for respectively acquiring the current position information of each processing center;
the second calculation unit is used for calculating the distance between each task group and each processing center according to the position information of the task processing party of each task to be processed and the position information of each processing center in each task group; and the distribution unit is used for distributing the task groups to the processing center closest to the distance between the task groups so that the processing center closest to the distance between the task groups processes the tasks to be processed in the task groups.
Wherein the second calculation unit includes:
a fourth calculating subunit, configured to, in response to that the task group only includes one to-be-processed task, for any one processing center, calculate, according to location information of a task processing party of the to-be-processed task included in the task group and current location information of the processing center, a distance between the task processing party of the to-be-processed task included in the task group and the processing center, and use the distance as the distance between the task group and the processing center;
and a fifth calculating subunit, configured to, in response to that the task group includes multiple to-be-processed tasks, for any one processing center, calculate, according to the location information of the task processing party of each to-be-processed task included in the task group and the current location information of the processing center, an average distance between the task processing party of each to-be-processed task included in the task group and the processing center, and use the average distance as the distance between the task group and the processing center.
The technical scheme provided by the embodiment of the invention has the following beneficial effects:
in the embodiment of the invention, a plurality of tasks to be processed are obtained; acquiring a plurality of processing centers for processing tasks; and allocating at least one task to be processed for each acquired processing center. According to the method provided by the embodiment of the invention, the manual allocation of the to-be-processed personnel is not needed, the cost is lower, and when more to-be-processed tasks are obtained, all the to-be-processed tasks can be allocated to the processing center for processing in a short time, so that the allocation efficiency is higher, and the processing center can start processing the to-be-processed tasks allocated to the processing center in time.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of embodiments of the invention.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the embodiments of the invention.
FIG. 1 is a flow diagram illustrating a method of task processing in accordance with an exemplary embodiment;
FIG. 2 is a flow diagram illustrating a method of task processing in accordance with an exemplary embodiment;
FIG. 3 is a flowchart illustrating a method of task processing in accordance with an exemplary embodiment;
FIG. 4 is a flowchart illustrating a method of task processing in accordance with an exemplary embodiment;
fig. 5 is a block diagram illustrating a task processing device according to an example embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with embodiments of the invention. Rather, they are merely examples of apparatus and methods consistent with certain aspects of embodiments of the invention, as detailed in the following claims.
Fig. 1 is a flowchart illustrating a task processing method, as shown in fig. 1, for use in a server, according to an exemplary embodiment, the method including the following steps.
In step S101, a plurality of tasks to be processed are acquired;
further, in another embodiment of the present invention, after this step, task attributes of each to-be-processed task may also be obtained, where the task attributes at least include resources occupied by the task.
In step S102, a plurality of processing centers for processing tasks are acquired;
among the acquired processing centers, there may be a processing center that is processing other tasks, and for a processing center that has a large number of tasks being processed, if a task group is allocated to the processing center, the processing center needs to complete the processing of the task being processed before starting processing of the task included in the task group allocated to the processing center, so that the processing center cannot complete the processing of the task to be processed in the task group quickly, and the efficiency of processing the task to be processed included in the task group is reduced.
Therefore, to improve the efficiency of processing tasks to be processed included in a task group. In the embodiment of the present invention, when acquiring the processing centers, it is necessary to acquire, among a plurality of different processing centers set in advance, a processing center whose number of tasks being processed is smaller than a second preset number. The second predetermined number may be 1, 2, or 3, etc., which is not limited in the present invention.
In general, in this step, all of the acquired processing centers are processing centers that are processing tasks, that is, all of the acquired processing centers are processing centers that are in an idle state.
In step S103, at least one task to be processed is allocated to each of the acquired processing centers.
So that each processing center can process the tasks to be processed assigned to it.
Wherein the tasks to be processed allocated to different processing centers are different.
Since a processing center needs to spend a certain amount of time processing a task, in order to process the multiple tasks to be processed as soon as possible, the number of the tasks to be processed allocated to each processing center needs to be reduced to the maximum extent.
However, if the number of processing centers acquired in step S102 is smaller than the number of to-be-processed tasks acquired in step S101, in order to ensure that each to-be-processed task can be processed, in another embodiment of the present invention, a plurality of to-be-processed tasks may be allocated to some of the processing centers.
In the embodiment of the invention, a plurality of tasks to be processed are obtained; acquiring a plurality of processing centers for processing tasks; and allocating at least one task to be processed for each acquired processing center. According to the method provided by the embodiment of the invention, the manual allocation of the to-be-processed personnel is not needed, the cost is lower, and when more to-be-processed tasks are obtained, all the to-be-processed tasks can be allocated to the processing center for processing in a short time, so that the allocation efficiency is higher, and the processing center can start processing the to-be-processed tasks allocated to the processing center in time.
In another embodiment of the present invention, after step S101, task attributes of each to-be-processed task may also be obtained, where the task attributes at least include the number of resources required for processing the to-be-processed task.
Therefore, step S103 may be: and grouping a plurality of tasks to be processed according to the acquired task attributes, wherein the number of the tasks to be processed in each task group is smaller than a first preset number threshold, or the sum of the number of resources required for processing the tasks to be processed in each task group is smaller than a preset resource number threshold, and then allocating at least one task group to each acquired processing center.
In another embodiment of the present invention, referring to fig. 2, grouping a plurality of tasks to be processed according to the obtained task attributes includes:
in step S201, each of a plurality of tasks to be processed is respectively grouped into a task subgroup;
for example, assume that the plurality of tasks to be processed are: a task to be processed 1, a task to be processed 2, a task to be processed 3, a task to be processed 4, a task to be processed 5 and a task to be processed 6; the tasks 1 to be processed may be grouped into a task subgroup 1, the tasks 2 to be processed may be grouped into a task subgroup 2, the tasks 3 to be processed may be grouped into a task subgroup 3, the tasks 4 to be processed may be grouped into a task subgroup 4, the tasks 5 to be processed may be grouped into a task subgroup 5, and the tasks 6 to be processed may be grouped into a task subgroup 6.
In step S202, a task group is formed by task subgroups whose total sum of resources occupied by tasks to be processed included in the processing is greater than a preset number threshold;
in the embodiment of the present invention, in the obtained multiple to-be-processed tasks, a certain number of resources are required for processing each to-be-processed task, and the number of resources required for processing each task may be different, and in the obtained multiple to-be-processed tasks, there may be a task whose number of resources required for processing is greater than a preset resource number threshold, or there may be no task whose number of resources required for processing is greater than a preset resource number threshold.
In the embodiment of the present invention, for any one to-be-processed task, the more the sum of the resources required to process the to-be-processed task is, the greater the processing difficulty of processing the to-be-processed task is, or the longer the time required to process the to-be-processed task is.
Therefore, if the task to be processed and other tasks form a task group, the processing center needs to spend more time to process all the tasks to be processed in the task group where the task to be processed is located, so that the processing efficiency of processing all the obtained tasks to be processed is reduced, or the processing difficulty of processing all the tasks to be processed in the task group where the task to be processed is located by the processing center is higher.
Therefore, in order to improve the processing efficiency of processing all the acquired tasks to be processed, or in order to reduce the processing difficulty of the processing center when processing the tasks to be processed, if there are tasks whose number of resources required for processing is greater than the preset resource number threshold, it is necessary to combine task subgroups whose total sum of resources occupied for processing the included tasks to be processed is greater than the preset resource number threshold into a task group. If there is a task subgroup in which the total sum of the resources required to process the included tasks to be processed is less than or equal to the preset resource number threshold, step S203 is executed.
For example, assume that the number of resources required to process the task to be processed 1 is 7, the number of resources required to process the task to be processed 2 is 4, the number of resources required to process the task to be processed 3 is 4, the number of resources required to process the task to be processed 4 is 20, the number of resources required to process the task to be processed 5 is 17, and the number of resources required to process the task to be processed 6 is 13, and the preset resource number threshold value is 15.
The number of resources required to process the to-be-processed task included in the task subgroup 1 is 7, the number of resources required to process the to-be-processed task included in the task subgroup 2 is 4, the number of resources required to process the to-be-processed task included in the task subgroup 3 is 4, the number of resources required to process the to-be-processed task included in the task subgroup 4 is 20, the number of resources required to process the to-be-processed task included in the task subgroup 5 is 17, and the number of resources required to process the to-be-processed task included in the task subgroup 6 is 13. At this time, the task subgroup 4 may be formed into a task group, and the task subgroup 5 may be formed into a task group, and at this time, the task subgroup 1, the task subgroup 2, the task subgroup 3, and the task subgroup 6 remain.
In step S203, in the remaining task subgroups, respectively calculating a distance between each two task subgroups according to task attributes of the tasks to be processed included in the task subgroups;
and the remaining task subgroups are task subgroups of which the sum of the number of resources required for processing the included tasks to be processed is less than or equal to a preset resource number threshold.
In this embodiment of the present invention, the task attribute of the task to be processed may further include: the position information of the task processing party of the task to be processed and the position information of the task requesting party of the task to be processed. In this way, for any two task subgroups in the remaining task subgroups, the distance between the two task subgroups can be calculated according to the position information of the task processor and the position information of the task requester of each task to be processed included in the two task subgroups. The specific calculation flow can be seen in the embodiment shown in fig. 3, and is not described in detail here.
The scenes of the embodiment of the invention comprise: the system comprises a server, a task processing party and a task requesting party.
If the task requester needs to generate a to-be-processed task requiring processing by the task handler, the task requester may send a generation request for generating the to-be-processed task requiring processing by the task handler to the server; when the server receives the generation request, generating a task to be processed, and distributing the task to be processed to a task processing party, wherein the task processing party is provided with a plurality of processing centers in advance, the processing centers are used for processing the task, and the task processing party can distribute the task to be processed to the processing centers in the plurality of processing centers for processing. Therefore, in response to the task handler receiving the to-be-processed task assigned by the server, the task handler may assign the generated to-be-processed task to one of the plurality of processing centers, so that the processing center processes the to-be-processed task. When the processing center finishes processing the task to be processed, the task processing party is indicated to finish processing the task to be processed.
In step S204, in response to that the sum of the number of resources required to process the to-be-processed tasks included in the two task sub-groups closest to each other is greater than a preset resource number threshold, or when the total number of the to-be-processed tasks included in the two task sub-groups closest to each other is greater than a first preset number threshold, the two task sub-groups closest to each other are combined into one task group;
in the embodiment of the present invention, the first preset number threshold may be 2, 3, or 4, and the like, which is not limited in the present invention.
For example, in the remaining task sub-group 1, task sub-group 2, task sub-group 3, and task sub-group 6, it is assumed that the distance between the task sub-group 1 and the task sub-group 2 is the closest, and the distance between the task sub-group 3 and the task sub-group 6 is the closest; and the first predetermined number threshold is 3.
The sum of the number of resources required for processing the tasks to be processed included in the task subgroup 3 and the number of resources required for processing the tasks to be processed included in the task subgroup 6 is 17, which is greater than the preset resource number threshold 15, so that the task subgroup 3 and the task subgroup 6 can form a task group, and the task group includes the tasks to be processed 3 and the tasks to be processed 6.
In step S205, in response to that the sum of the number of resources required to process the to-be-processed tasks included in the two task subgroups closest to each other is less than or equal to the preset resource number threshold, or the total number of the to-be-processed tasks included in the two task subgroups closest to each other is less than or equal to the first preset number threshold, the two task subgroups closest to each other are combined into a new task subgroup, and the process returns to step S203.
In the embodiment of the present invention, in response to that the sum of the number of resources required to process the to-be-processed tasks included in the two task sub-groups closest to the processing distance is less than or equal to a preset resource number threshold, or that the total number of the to-be-processed tasks included in the two task sub-groups closest to the processing distance is less than or equal to a first preset number threshold, if there is no other task sub-group other than the two task sub-groups closest to the processing distance in the remaining task sub-groups, the two task sub-groups closest to the processing distance may be combined into one task group; if there are other task subgroups in the remaining task subgroups besides the two task subgroups closest to the task subgroup, the two task subgroups closest to the task subgroup are combined into a new task subgroup, and the process returns to step S203.
For example, the sum of the number of resources required for processing the tasks to be processed included in the task subgroup 1 and the number of resources required for processing the tasks to be processed included in the task subgroup 2 is 11, which is smaller than the preset resource number threshold 15, and the total number of the tasks to be processed included in the task subgroup 1 and the task subgroup 2 is 2, which is smaller than the first preset number threshold 3, at this time, in the remaining task subgroups, there is no other task subgroup except for the task subgroup 1 and the task subgroup 2, so that the task subgroup 1 and the task subgroup 2 may be formed into one task group, which includes the tasks to be processed 1 and the tasks to be processed 2.
In the embodiment shown in fig. 2, the task attributes of the task to be processed further include: in another embodiment of the present invention, for any two task subgroups, referring to fig. 3, the distance between the two task subgroups may be calculated through the following processes from S301 to S303, including:
in step S301, according to the position information of the task processing party of each task to be processed included in the two task subgroups, a first distance between the task processing party of the task to be processed included in the first task subgroup and the task processing party of the task to be processed included in the second task subgroup is calculated;
specifically, the task processing party distance between the task processing party of each to-be-processed task included in the first task subgroup and the task processing party of each to-be-processed task included in the second task subgroup can be calculated according to the position information of the task processing party of each to-be-processed task included in the first task subgroup and the position information of the task processing party of each to-be-processed task included in the second task subgroup; and calculating the average value of all the obtained task processing party distances, and taking the average value as the first distance.
The task processing method comprises the steps of calculating the distance between the task processing party of any one task to be processed in the first task subgroup and the task processing party of each task to be processed in the second task subgroup, executing the operation for the task processing parties of other tasks to be processed in the first task subgroup, obtaining the distance between the task processing party of each task to be processed in the first task subgroup and the task processing party of each task to be processed in the second task subgroup, summing all the calculated distances between the task processing parties to obtain the sum of the distances between the task processing parties, dividing the sum of the distances between the task processing parties by the number of the calculated distances between the task processing parties to obtain the sum of the distances between the task processing parties of the tasks to be processed in the first task subgroup and the tasks to be processed in the second task subgroup A first distance between task handlers.
In step S302, according to the position information of the task requester of each task to be processed included in the two task subgroups, calculating a second distance between the task handler of the task to be processed included in the first task subgroup and the task requester of the task to be processed included in the second task subgroup;
specifically, the task requester distance between the task requester of each to-be-processed task included in the first task subgroup and the task requester of each to-be-processed task included in the second task subgroup may be calculated according to the position information of the task requester of each to-be-processed task included in the first task subgroup and the position information of the task requester of each to-be-processed task included in the second task subgroup; and calculating the average value of all the obtained task requester distances, and taking the average value as the second distance.
The task requester of any task to be processed in the first task subgroup and the task requester of each task to be processed in the second task subgroup are calculated, the same operation is performed on the task requesters of other tasks to be processed in the first task subgroup, so that the task requester distance between the task requester of each task to be processed in the first task subgroup and the task requester of each task to be processed in the second task subgroup is obtained, then the calculated task requester distances are summed to obtain the task requester distance sum, and then the task requester distance sum is divided by the calculated number of the task requester distances to obtain the task requester of the task to be processed in the first task subgroup and the task requester of the task to be processed in the second task subgroup A second distance between task requesters.
In step S303, a distance between the first task subgroup and the second task subgroup is calculated according to the first distance, the second distance and a preset coefficient.
Calculating the distance between the first task subgroup and the second task subgroup according to the following formula according to the first distance, the second distance and a preset coefficient;
S＝m*A+n*B；
in the above formula, S is a distance between the first task subgroup and the second task subgroup, m and n are both predetermined coefficients, a is a first distance, and B is a second distance. Where the sum of m and n may be 1, for example m may be 0.5 and n may be 0.5.
In another embodiment of the present invention, referring to fig. 4, allocating at least one task group to each acquired processing center includes:
in step S401, current location information of each processing center is acquired;
in the embodiment of the invention, the position of the processing center may be changed continuously, the processing center is in communication connection with the server, and the processing center can report the position information of the processing center to the server in real time or periodically.
In step S402, for any one task group, the distance between the task group and each processing center is calculated according to the position information of the task processing side of each task to be processed and the position information of each processing center included in the task group, and then the task group is assigned to the processing center closest to the distance between the task groups, so that the processing center closest to the distance between the task groups processes the task to be processed included in the task group.
For each of the other task groups, the above operations are performed, so that each task group is assigned to the processing center process closest to the task group.
In the embodiment of the present invention, calculating the distance between each processing center and each task group according to the location information of the task processing party of each task to be processed and the location information of each processing center included in the task group includes:
when the task group only comprises one task to be processed, for any processing center, calculating the distance between the task processing party of the task to be processed included in the task group and the processing center according to the position information of the task processing party of the task to be processed included in the task group and the current position information of the processing center, and taking the distance as the distance between the task group and the processing center. For each of the other processing centers, the above-mentioned operations are also performed, so that the distance between the task group and each processing center can be obtained.
When the task group includes a plurality of tasks to be processed, for any one processing center, calculating an average distance between the task processing party of each task to be processed included in the task group and the processing center according to the position information of the task processing party of each task to be processed included in the task group and the current position information of the processing center, and taking the average distance as the distance between the task group and the processing center. For each of the other processing centers, the above-mentioned operations are also performed, so that the distance between the task group and each processing center can be obtained.
For example, for any one to-be-processed task included in the task group, the distance between the task processing party of the to-be-processed task and the processing center is calculated according to the position information of the task processing party of the to-be-processed task and the current position information of the processing center, the above operations are performed for each other to-be-processed task included in the task group, so that the distance between the task processing party of each to-be-processed task included in the task group and the processing center can be obtained, the obtained distances between the task processing party of each to-be-processed task included in the task group and the processing center are summed to obtain a distance sum, then the distance sum is divided by the number of to-be-processed tasks included in the task group to obtain an average distance between the task processing party of each to-be-processed task included in the task group and the processing center, and as the distance between the task group and the processing center. For each of the other processing centers, the above-mentioned operations are also performed, so that the distance between the task group and each processing center can be obtained.
Fig. 5 is a block diagram illustrating a task processing device according to an example embodiment. Referring to fig. 5, the apparatus includes:
a first obtaining module 11, configured to obtain a plurality of tasks to be processed;
a second obtaining module 12, configured to obtain a plurality of processing centers for processing tasks;
the distribution module 13 is configured to distribute at least one task to be processed to each acquired processing center; the processing center is used for processing tasks.
Further, the apparatus further comprises:
and the third acquisition module is used for acquiring the task attribute of each task to be processed, wherein the task attribute at least comprises the quantity of resources required for processing the task to be processed.
Wherein the distribution module 13 comprises:
the grouping submodule is used for grouping the plurality of tasks to be processed according to the acquired task attributes, wherein the number of the tasks to be processed in each task group is smaller than a first preset number threshold, or the sum of the number of resources required for processing the tasks to be processed in each task group is smaller than a preset resource number threshold;
and the distribution submodule is used for distributing at least one task group for each acquired processing center.
Wherein the grouping submodule includes:
the first composition unit is used for respectively composing each task to be processed in the plurality of tasks to be processed into a task subgroup;
the second composition unit is used for composing a task group by the task subgroups, wherein the total sum of resources occupied by the tasks to be processed is larger than a preset number threshold value;
the first computing unit is used for respectively computing the distance between every two task subgroups according to the task attributes of the tasks to be processed in the remaining task subgroups;
a third forming unit, configured to form one task group from the two task subgroups closest to the processing unit in response to that a sum of numbers of resources required to process the tasks to be processed included in the two task subgroups closest to the processing unit is greater than a preset resource number threshold, or that a total number of tasks to be processed included in the two task subgroups closest to the processing unit is greater than a first preset number threshold;
and a fourth composing unit, configured to, in response to that a sum of numbers of resources required to process the to-be-processed tasks included in the two task subgroups closest to each other is less than or equal to a preset resource number threshold, or that a total number of the to-be-processed tasks included in the two task subgroups closest to each other is less than or equal to a first preset number threshold, compose the two task subgroups closest to each other into a new task subgroup, return to the remaining task subgroups, and calculate distances between each two task subgroups according to task attributes of the to-be-processed tasks included in the task subgroups.
Wherein the task attributes further include: position information of a task handler of the task to be processed and position information of a task requester of the task to be processed,
the first calculation unit includes:
for any two task subgroups in the remaining task subgroups, a first calculating subunit is configured to calculate, according to location information of a task handler of each task to be processed included in the two task subgroups, a first distance between a task handler of the task to be processed included in a first task subgroup included in the two task subgroups and a task handler of the task to be processed included in a second task subgroup;
the second calculating subunit is configured to calculate, according to the position information of the task requester of each to-be-processed task included in the two task subgroups, a second distance between the task handler of the to-be-processed task included in the first task subgroup and the task requester of the to-be-processed task included in the second task subgroup;
and the third calculation subunit is used for calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient.
Wherein the first computing subunit is specifically configured to:
calculating a task processing party distance between the task processing party of each task to be processed in the first task subgroup and the task processing party of each task to be processed in the second task subgroup according to the position information of the task processing party of each task to be processed in the first task subgroup and the position information of the task processing party of each task to be processed in the second task subgroup;
and calculating the average value of all the obtained task processing party distances, and taking the average value as the first distance.
Wherein the second calculating subunit is specifically configured to:
calculating a task requester distance between a task requester of each to-be-processed task in the first task subgroup and a task requester of each to-be-processed task in the second task subgroup according to the position information of the task requester of each to-be-processed task in the first task subgroup and the position information of the task requester of each to-be-processed task in the second task subgroup;
and calculating the average value of all the obtained task requester distances, and taking the average value as the second distance.
Wherein the third computing subunit is specifically configured to:
calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient and the following formula;
S＝m*A+n*B；
in the above formula, S is a distance between the first task subgroup and the second task subgroup, m and n are both the preset coefficients, a is the first distance, and B is the second distance.
The second obtaining module is specifically configured to:
and acquiring processing centers of which the number of the tasks being processed is less than a second preset number from a plurality of different processing centers which are preset.
Wherein the allocation submodule comprises:
the acquisition unit is used for respectively acquiring the current position information of each processing center;
the second calculation unit is used for calculating the distance between each task group and each processing center according to the position information of the task processing party of each task to be processed and the position information of each processing center in each task group; and the distribution unit is used for distributing the task groups to the processing center closest to the distance between the task groups so that the processing center closest to the distance between the task groups processes the tasks to be processed in the task groups.
Wherein the second calculation unit includes:
a fourth calculating subunit, configured to, in response to that the task group only includes one to-be-processed task, for any one processing center, calculate, according to location information of a task processing party of the to-be-processed task included in the task group and current location information of the processing center, a distance between the task processing party of the to-be-processed task included in the task group and the processing center, and use the distance as the distance between the task group and the processing center;
and a fifth calculating subunit, configured to, in response to that the task group includes multiple to-be-processed tasks, for any one processing center, calculate, according to the location information of the task processing party of each to-be-processed task included in the task group and the current location information of the processing center, an average distance between the task processing party of each to-be-processed task included in the task group and the processing center, and use the average distance as the distance between the task group and the processing center.
In the embodiment of the invention, a plurality of tasks to be processed are obtained; acquiring a plurality of processing centers for processing tasks; and allocating at least one task to be processed for each acquired processing center. According to the method provided by the embodiment of the invention, the manual allocation of the to-be-processed personnel is not needed, the cost is lower, and when more to-be-processed tasks are obtained, all the to-be-processed tasks can be allocated to the processing center for processing in a short time, so that the allocation efficiency is higher, and the processing center can start processing the to-be-processed tasks allocated to the processing center in time.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the embodiments of the invention following, in general, the principles of the embodiments of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the embodiments of the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the embodiments of the invention being indicated by the following claims.
It is to be understood that the embodiments of the present invention are not limited to the precise arrangements described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of embodiments of the invention is limited only by the appended claims.
Claims (18)
1. A task processing method is applied to a server, and is characterized in that the method comprises the following steps:
acquiring a plurality of tasks to be processed;
acquiring a plurality of processing centers for processing tasks;
distributing at least one task to be processed for each acquired processing center; the processing center is used for processing tasks;
after the plurality of tasks to be processed are obtained, the method further comprises the following steps:
acquiring task attributes of each task to be processed, wherein the task attributes at least comprise the quantity of resources required for processing the task to be processed, the position information of a task processor of the task to be processed and the position information of a task requester of the task to be processed;
the allocating at least one task to be processed to each acquired processing center includes:
grouping the plurality of tasks to be processed according to the quantity of resources required by the tasks to be processed, the position information of the task processing party of the tasks to be processed and the position information of the task requesting party of the tasks to be processed, wherein the quantity of the tasks to be processed in each task group is smaller than a first preset quantity threshold value, or the sum of the quantities of the resources required by the tasks to be processed in each task group is smaller than a preset resource quantity threshold value;
at least one task group is assigned to each acquired processing center.
2. The method of claim 1, wherein the grouping the plurality of pending tasks according to the amount of resources required for the pending tasks, the location information of the task handler of the pending task, and the location information of the task requester of the pending task comprises:
respectively forming each task to be processed in the plurality of tasks to be processed into a task subgroup;
forming a task group by task subgroups, wherein the sum of resources occupied by tasks to be processed is greater than a preset number threshold;
in the rest task subgroups, respectively calculating the distance between every two task subgroups according to the task attributes of the tasks to be processed in the task subgroups;
responding to the situation that the sum of the number of resources required for processing the tasks to be processed in the two task sub-groups which are closest to each other is larger than a preset resource number threshold value, or the situation that the total number of the tasks to be processed in the two task sub-groups which are closest to each other is larger than a first preset number threshold value, and forming the two task sub-groups which are closest to each other into a task group;
and in response to the fact that the sum of the number of resources required for processing the tasks to be processed included in the two task subgroups closest to each other is smaller than or equal to a preset resource number threshold, or the total number of the tasks to be processed included in the two task subgroups closest to each other is smaller than or equal to a first preset number threshold, forming the two task subgroups closest to each other into a new task subgroup, returning to the remaining task subgroups, and calculating the distance between every two task subgroups according to the task attributes of the tasks to be processed included in the task subgroups.
3. The method of claim 2, wherein the task attributes further comprise: position information of a task handler of the task to be processed and position information of a task requester of the task to be processed,
the step of respectively calculating the distance between every two task subgroups according to the task attributes of the tasks to be processed in the task subgroups comprises the following steps:
for any two task subgroups in the remaining task subgroups, calculating a first distance between a task processing party of a task to be processed included in a first task subgroup and a task processing party of a task to be processed included in a second task subgroup according to position information of the task processing party of each task to be processed included in the two task subgroups;
according to the position information of the task requester of each task to be processed in the two task subgroups, calculating a second distance between the task processor of the task to be processed in the first task subgroup and the task requester of the task to be processed in the second task subgroup;
and calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient.
4. The method according to claim 3, wherein said calculating a first distance between a task handler of a task to be processed included in a first task subgroup and a task handler of a task to be processed included in a second task subgroup, based on location information of a task handler of each task to be processed included in the two task subgroups, comprises:
calculating a task processing party distance between the task processing party of each task to be processed in the first task subgroup and the task processing party of each task to be processed in the second task subgroup according to the position information of the task processing party of each task to be processed in the first task subgroup and the position information of the task processing party of each task to be processed in the second task subgroup;
and calculating the average value of all the obtained task processing party distances, and taking the average value as the first distance.
5. The method according to claim 3, wherein calculating a second distance between a task handler of a to-be-processed task included in a first task subgroup and a task requester of a to-be-processed task included in a second task subgroup according to location information of the task requester of each to-be-processed task included in the two task subgroups comprises:
calculating a task requester distance between a task requester of each to-be-processed task in the first task subgroup and a task requester of each to-be-processed task in the second task subgroup according to the position information of the task requester of each to-be-processed task in the first task subgroup and the position information of the task requester of each to-be-processed task in the second task subgroup;
and calculating the average value of all the obtained task requester distances, and taking the average value as the second distance.
6. The method of claim 3, wherein said calculating the distance between the first task subset and the second task subset according to the first distance, the second distance and a preset coefficient comprises:
calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient and the following formula;
S＝m*A+n*B；
in the above formula, S is a distance between the first task subgroup and the second task subgroup, m and n are both the preset coefficients, a is the first distance, and B is the second distance.
7. The method of claim 1, wherein said obtaining a plurality of processing centers for processing tasks comprises:
and acquiring processing centers of which the number of the tasks being processed is less than a second preset number from a plurality of different processing centers which are preset.
8. The method of claim 1, wherein said assigning at least one task group to each acquired processing center comprises:
respectively acquiring current position information of each processing center;
for any task group, calculating the distance between each task group and each processing center according to the position information of the task processing party of each task to be processed and the position information of each processing center in the task group; and then distributing the task groups to the processing centers closest to the distance between the task groups so that the processing centers closest to the distance between the task groups process the tasks to be processed included in the task groups.
9. The method according to claim 8, wherein the calculating the distance between the task group and each processing center according to the position information of the task processing party of each task to be processed and the position information of each processing center included in the task group comprises:
responding to that only one task to be processed is included in the task group, and calculating the distance between the task processing party of the task to be processed included in the task group and the processing center according to the position information of the task processing party of the task to be processed included in the task group and the current position information of the processing center for any processing center, wherein the distance is used as the distance between the task group and the processing center;
and responding to the fact that the task group comprises a plurality of tasks to be processed, and for any processing center, calculating the average distance between the task processing party of each task to be processed and the processing center according to the position information of the task processing party of each task to be processed and the current position information of the processing center in the task group, and taking the average distance as the distance between the task group and the processing center.
10. A task processing device applied to a server is characterized by comprising:
the first acquisition module is used for acquiring a plurality of tasks to be processed;
the second acquisition module is used for acquiring a plurality of processing centers for processing tasks;
the distribution module is used for distributing at least one task to be processed for each acquired processing center; the processing center is used for processing tasks;
the device further comprises:
a third obtaining module, configured to obtain task attributes of each to-be-processed task, where the task attributes at least include the number of resources required for processing the to-be-processed task, location information of a task processor of the to-be-processed task, and location information of a task requester of the to-be-processed task;
the distribution module includes:
the grouping submodule is used for grouping the plurality of tasks to be processed according to the quantity of resources required by the tasks to be processed, the position information of the task processing party of the tasks to be processed and the position information of the task requesting party of the tasks to be processed, wherein the quantity of the tasks to be processed in each task group is smaller than a first preset quantity threshold value, or the sum of the quantity of the resources required by the tasks to be processed in each task group is smaller than a preset resource quantity threshold value;
and the distribution submodule is used for distributing at least one task group for each acquired processing center.
11. The apparatus of claim 10, wherein the grouping submodule comprises:
the first composition unit is used for respectively composing each task to be processed in the plurality of tasks to be processed into a task subgroup;
the second composition unit is used for composing a task group by the task subgroups, wherein the total sum of resources occupied by the tasks to be processed is larger than a preset number threshold value;
the first computing unit is used for respectively computing the distance between every two task subgroups according to the task attributes of the tasks to be processed in the remaining task subgroups;
a third forming unit, configured to form one task group from the two task subgroups closest to the processing unit in response to that a sum of numbers of resources required to process the tasks to be processed included in the two task subgroups closest to the processing unit is greater than a preset resource number threshold, or that a total number of tasks to be processed included in the two task subgroups closest to the processing unit is greater than a first preset number threshold;
and a fourth composing unit, configured to, in response to that a sum of numbers of resources required to process the to-be-processed tasks included in the two task subgroups closest to each other is less than or equal to a preset resource number threshold, or that a total number of the to-be-processed tasks included in the two task subgroups closest to each other is less than or equal to a first preset number threshold, compose the two task subgroups closest to each other into a new task subgroup, return to the remaining task subgroups, and calculate distances between each two task subgroups according to task attributes of the to-be-processed tasks included in the task subgroups.
12. The apparatus of claim 11, wherein the task attributes further comprise: position information of a task handler of the task to be processed and position information of a task requester of the task to be processed,
the first calculation unit includes:
for any two task subgroups in the remaining task subgroups, a first calculating subunit is configured to calculate, according to location information of a task handler of each task to be processed included in the two task subgroups, a first distance between a task handler of the task to be processed included in a first task subgroup included in the two task subgroups and a task handler of the task to be processed included in a second task subgroup;
the second calculating subunit is configured to calculate, according to the position information of the task requester of each to-be-processed task included in the two task subgroups, a second distance between the task handler of the to-be-processed task included in the first task subgroup and the task requester of the to-be-processed task included in the second task subgroup;
and the third calculation subunit is used for calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient.
13. The apparatus according to claim 12, wherein the first computing subunit is specifically configured to:
calculating a task processing party distance between the task processing party of each task to be processed in the first task subgroup and the task processing party of each task to be processed in the second task subgroup according to the position information of the task processing party of each task to be processed in the first task subgroup and the position information of the task processing party of each task to be processed in the second task subgroup;
and calculating the average value of all the obtained task processing party distances, and taking the average value as the first distance.
14. The apparatus according to claim 12, wherein the second computing subunit is specifically configured to:
calculating a task requester distance between a task requester of each to-be-processed task in the first task subgroup and a task requester of each to-be-processed task in the second task subgroup according to the position information of the task requester of each to-be-processed task in the first task subgroup and the position information of the task requester of each to-be-processed task in the second task subgroup;
and calculating the average value of all the obtained task requester distances, and taking the average value as the second distance.
15. The apparatus according to claim 12, wherein the third computing subunit is specifically configured to:
calculating the distance between the first task subgroup and the second task subgroup according to the first distance, the second distance and a preset coefficient and the following formula;
S＝m*A+n*B；
in the above formula, S is a distance between the first task subgroup and the second task subgroup, m and n are both the preset coefficients, a is the first distance, and B is the second distance.
16. The apparatus of claim 10, wherein the second obtaining module is specifically configured to:
and acquiring processing centers of which the number of the tasks being processed is less than a second preset number from a plurality of different processing centers which are preset.
17. The apparatus of claim 10, wherein the assignment sub-module comprises:
the acquisition unit is used for respectively acquiring the current position information of each processing center;
the second calculation unit is used for calculating the distance between each task group and each processing center according to the position information of the task processing party of each task to be processed and the position information of each processing center in each task group; and the distribution unit is used for distributing the task groups to the processing center closest to the distance between the task groups so that the processing center closest to the distance between the task groups processes the tasks to be processed in the task groups.
18. The apparatus of claim 17, wherein the second computing unit comprises:
a fourth calculating subunit, configured to, in response to that the task group only includes one to-be-processed task, for any one processing center, calculate, according to location information of a task processing party of the to-be-processed task included in the task group and current location information of the processing center, a distance between the task processing party of the to-be-processed task included in the task group and the processing center, and use the distance as the distance between the task group and the processing center;
and a fifth calculating subunit, configured to, in response to that the task group includes multiple to-be-processed tasks, for any one processing center, calculate, according to the location information of the task processing party of each to-be-processed task included in the task group and the current location information of the processing center, an average distance between the task processing party of each to-be-processed task included in the task group and the processing center, and use the average distance as the distance between the task group and the processing center.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610979473.XA CN107092999B (en) | 2016-11-08 | 2016-11-08 | Task processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610979473.XA CN107092999B (en) | 2016-11-08 | 2016-11-08 | Task processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107092999A CN107092999A (en) | 2017-08-25 |
| CN107092999B true CN107092999B (en) | 2021-02-26 |
Family
ID=59648668
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610979473.XA Active CN107092999B (en) | 2016-11-08 | 2016-11-08 | Task processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107092999B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108460554B (en) * | 2018-02-06 | 2021-12-03 | 北京星选科技有限公司 | Task distribution method and device, electronic equipment and computer readable storage medium |
| CN108805397A (en) * | 2018-04-24 | 2018-11-13 | 平安科技（深圳）有限公司 | Electronic device, the method and storage medium for distributing task |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101702833A (en) * | 2009-10-27 | 2010-05-05 | 武汉理工大学 | Task scheduling method of movable grid |
| CN102243598A (en) * | 2010-05-14 | 2011-11-16 | 深圳市腾讯计算机系统有限公司 | Task scheduling method and system in distributed data warehouse |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102902587B (en) * | 2011-07-28 | 2015-10-07 | 中国移动通信集团四川有限公司 | Distributed task dispatching mthods, systems and devices |
| CN103294531B (en) * | 2012-03-05 | 2017-03-01 | 阿里巴巴集团控股有限公司 | A kind of method for allocating tasks and system |
| CN103473334B (en) * | 2013-09-18 | 2017-01-11 | 中控技术（西安）有限公司 | Data storage method, inquiry method and system |
| US9778987B2 (en) * | 2014-01-31 | 2017-10-03 | International Business Machines Corporation | Writing encoded data slices in a dispersed storage network |
| CN105656973B (en) * | 2014-11-25 | 2018-11-13 | 中国科学院声学研究所 | Method for scheduling task and system in a kind of distributed node group |
| CN105719009A (en) * | 2015-07-24 | 2016-06-29 | 北京小度信息科技有限公司 | Method and device for processing distribution tasks |
| CN105243499A (en) * | 2015-10-16 | 2016-01-13 | 携程计算机技术（上海）有限公司 | Order distribution method and system |
| CN105487930B (en) * | 2015-12-01 | 2018-10-16 | 中国电子科技集团公司第二十八研究所 | A kind of optimizing and scheduling task method based on Hadoop |
-
2016
- 2016-11-08 CN CN201610979473.XA patent/CN107092999B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101702833A (en) * | 2009-10-27 | 2010-05-05 | 武汉理工大学 | Task scheduling method of movable grid |
| CN102243598A (en) * | 2010-05-14 | 2011-11-16 | 深圳市腾讯计算机系统有限公司 | Task scheduling method and system in distributed data warehouse |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107092999A (en) | 2017-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107341050B (en) | Service processing method and device based on dynamic thread pool | |
| CN108734559B (en) | Order processing method and device | |
| CN106779910B (en) | Distribution order distribution method and device | |
| WO2018095066A1 (en) | Method and device for task grouping, electronic device, and computer storage medium | |
| EP1253516A2 (en) | Apparatus and method for scheduling processes on a fair share basis | |
| CN103414752B (en) | A kind of cloud data center virtual machine distribution method of network aware | |
| CN110991808B (en) | Task allocation method and device | |
| US9405588B2 (en) | Cloud resource allocation system and method | |
| CN105719221B (en) | Path collaborative planning method and device for multiple tasks | |
| CN105589750A (en) | CPU (Central Processing Unit) resource scheduling method and server | |
| CN109272272B (en) | Task processing method and device, electronic equipment and computer readable storage medium | |
| CN112887228B (en) | Cloud resource management method and device, electronic equipment and computer readable storage medium | |
| CN105471950A (en) | Distributed computing method and system | |
| CN107682391B (en) | Electronic device, server allocation control method, and computer-readable storage medium | |
| US20170339069A1 (en) | Allocating Cloud Computing Resources In A Cloud Computing Environment | |
| CN107092999B (en) | Task processing method and device | |
| US9471391B1 (en) | Aggregating resource requests | |
| CN109947551A (en) | A kind of more round method for allocating tasks, edge calculations system and its storage medium | |
| CN111427551A (en) | User code operation method of programming platform, equipment and storage medium | |
| CN111776896B (en) | Elevator dispatching method and device | |
| CN104268007A (en) | Distributed event request scheduling method and system | |
| CN108153494B (en) | A kind of I/O request processing method and processing device | |
| CN107547599B (en) | Resource allocation method and system | |
| CN106325997B (en) | Virtual resource allocation method and device | |
| US20100161797A1 (en) | Balancing user registration lifetimes in a network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: Room 202, 2 / F, 1-3 / F, No. 11, Shangdi Information Road, Haidian District, Beijing 100084 Applicant after: Beijing Xingxuan Technology Co.,Ltd. Address before: 100085 Beijing, Haidian District on the road to the information on the ground floor of the 1 to the 3 floor of the 2 floor, room 11, 202 Applicant before: Beijing Xiaodu Information Technology Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |