Task allocation method and device, medium and equipment

Abstract

The invention relates to the technical field of data processing, in particular to a task allocation method and device, a medium and equipment. Comprising the following steps: if at least two target executors are determined from a plurality of task executors, acquiring a priority corresponding to each target executor; and sending prompt information corresponding to the to-be-allocated task according to the priority corresponding to each target executor from high to low until any target executor determines to execute the to-be-allocated task. According to the method, allocation is performed according to the priorities of the target executors instead of being directly sent to all the task executors, so that server resource occupation is reduced, more adaptive target executors can be matched for users as much as possible, and user satisfaction is improved. And for the execution personnel, all the tasks to be distributed are not received, and the tasks with relatively high adaptation degree are received, so that the task screening time is saved.

Description

Background Art

[0002] In order to more efficiently match the demand for accompanying medical consultations with the supply of services, numerous accompanying medical consultation service platforms have emerged, aiming to connect users with accompanying medical consultation needs and professionals providing accompanying medical consultation services through information technology, so that users can easily publish accompanying medical consultation orders and service personnel can obtain and respond to corresponding tasks in a timely manner, so as to improve the overall efficiency of accompanying medical consultation services.

[0003] However, in the operation of the existing medical companion platforms, there are obvious defects in order allocation. Specifically, when the platform determines to execute the medical companion order issued by the user, it often adopts a relatively extensive broadcast allocation method, that is, directly sending the order information to each service staff without distinction. Although this allocation mode seems to ensure that all service staff have the opportunity to know the order status, it actually brings many problems.

[0004] On the one hand, from the perspective of resource utilization, since the platform will send orders to all service personnel, regardless of whether these service personnel currently have the ability to meet the specific requirements of the order (such as the distance from the medical treatment location, the type of department they are good at serving, the current workload they can undertake, etc.), they will receive order reminders. This leads to a large amount of unnecessary information push, which requires service personnel to spend extra time to check and identify these orders that may not match them, thereby wasting the service personnel's valuable working time and the platform's information push resources, network communication resources, etc.

[0005] On the other hand, from the perspective of service response speed, this mode of directly sending all orders also has obvious disadvantages. Because all service personnel simultaneously determine the execution of a large amount of order information, it takes a certain amount of time to filter out the orders that suit them and respond to them. Especially when there are a large number of platform service personnel and a large number of orders, information congestion and response delays are prone to occur. For users who are in urgent need of medical escort services, they may face the trouble of waiting for a long time without getting a timely response, which greatly affects the user experience and reduces the efficiency of the entire medical escort service.

[0006] To sum up, the existing medical accompanying platform directly sends user orders to each service staff in the order allocation link, which wastes resources and has slow response speed. It is urgent to improve it with a more scientific and efficient order allocation technology to optimize the overall operational efficiency of the medical accompanying platform, improve user satisfaction and the rationality of resource utilization. Summary of the invention

[0007] The technical problem to be solved by this application is: how to optimize the overall operational efficiency of the accompanying medical consultation platform, improve user satisfaction and the rationality of resource utilization.

[0008] In view of the above technical problem, according to the first aspect of the present application, a task allocation method is provided, and the method includes:

[0009] If at least two target executors are determined from a number of task executors, the priority corresponding to each target executor is obtained; wherein the priority indicates the degree of matching between the target executor and the task to be assigned; the target executor is pre-set with a preset working time period and a preset execution location, and the preset working time period pre-set by the target executor at least partially overlaps with the execution time period corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executor is the same as the execution location corresponding to the task to be assigned;

[0010] The prompt information corresponding to the task to be assigned is sent in descending order according to the priority corresponding to each target executor until any target executor decides to execute the task to be assigned; wherein the prompt information is used to prompt the user to determine whether to execute the task to be assigned.

[0011] In an exemplary embodiment of the present application, the target executor meets the following conditions:

[0012] The preset available working time period pre-set by the target executor at least partially overlaps with the execution time period corresponding to the task to be assigned; and / or

[0013] The preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the to-be-assigned task; and

[0014] Any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned.

[0015] In an exemplary embodiment of the present application, the target executor meets the following conditions:

[0016] The preset available working time period pre-set by the target executor at least partially overlaps with the to-be-executed time period corresponding to the to-be-assigned task; and

[0017] The preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the to-be-assigned task; and

[0018] Any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned.

[0019] In an exemplary embodiment of the present application, the prompt information corresponding to the task to be assigned is sent in descending order according to the priority corresponding to each target executor until any target executor determines to execute the task to be assigned, including:

[0020] Set the target executor with the highest current priority as the current executor;

[0021] Assign pending tasks to current executors;

[0022] If the current executor does not confirm to execute the above-mentioned task to be assigned within the preset response time, the current executor will be deleted and the process will jump to the step "Set the target executor with the highest current priority as the current executor" until the current executor confirms to execute the above-mentioned task to be assigned.

[0023] In an exemplary embodiment of the present application, the prompt information corresponding to the task to be assigned is sent in descending order according to the priority corresponding to each target executor until any target executor determines to execute the task to be assigned, including:

[0024] According to the order of priority from high to low, the preset number of target executors in the front are set as the current execution group;

[0025] Allocate the tasks to be assigned to each target executor of the current execution group;

[0026] If within the preset response time, each target executor of the current execution group has not confirmed to execute the above-mentioned task to be assigned, the current execution group will be deleted and the process will jump to the step of "setting the first preset number of target executors as the current execution group in order of priority from high to low" until any target executor confirms to execute the above-mentioned task to be assigned.

[0027] In an exemplary embodiment of the present application, after sending the prompt information corresponding to the task to be assigned in order of priority from high to low for each target executor, the method further includes:

[0028] If each target executor has not confirmed to perform the above-mentioned to-be-assigned task, then a number of preset areas are obtained with the to-be-assigned task corresponding to the to-be-assigned task as the center of the circle and different preset distances as the radius; wherein any two adjacent preset areas do not overlap;

[0029] Determine the preset area with the smallest preset distance as the current area to be allocated;

[0030] Sending the task to be assigned to each key executor except the target executor in the current area to be assigned; wherein the key executor is pre-set with a preset execution location and at least one preset executable task type; the key executor is determined from a number of task executors; any preset executable task type corresponding to the key executor is the same as the task type corresponding to the task to be assigned;

[0031] If every key executor except the target executor in the current area to be assigned has not determined to perform the above-mentioned task to be assigned, the above-mentioned current area to be assigned will be deleted, and the process will jump to the step of "determining the preset area with the smallest preset distance as the current area to be assigned" until any key executor determines to perform the above-mentioned task to be assigned.

[0032] In an exemplary embodiment of the present application, the preset executable task type is mandatory information for each task executor, and the preset working time period and preset execution location are non-mandatory information for each task executor; if each key executor in each preset area of ​​a plurality of preset areas has not determined to execute the above-mentioned task to be assigned, the above-mentioned method further includes:

[0033] The prompt information corresponding to the task to be assigned is sent to each key executor and each executable person in the preset administrative area corresponding to the task to be assigned, except for several preset areas, wherein the above-mentioned executable person is a task executor for which non-mandatory information is not set.

[0034] According to a second aspect of the present application, a task allocation device is provided, the device comprising:

[0035] A priority determination unit, for obtaining the priority corresponding to each target executor if at least two target executors are determined from a number of task executors; wherein the priority indicates the degree of matching between the target executor and the task to be assigned; the target executor is pre-set with a preset available working time period and a preset execution location, and the preset available working time period pre-set by the target executor at least partially overlaps with the to-be-executed time period corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the task to be assigned;

[0036] The task assignment unit is used to send the prompt information corresponding to the task to be assigned in order from high to low priority corresponding to each target executor until any target executor decides to execute the above-mentioned task to be assigned; wherein the above-mentioned prompt information is used to prompt the user to determine whether to execute the above-mentioned task to be assigned.

[0037] According to a third aspect of the present application, a non-transitory computer-readable storage medium is provided, in which at least one instruction or at least one program is stored, and the at least one instruction or at least one program is loaded and executed by a processor to implement the above-mentioned task allocation method.

[0038] According to a fourth aspect of the present application, there is provided an electronic device comprising a processor and the above-mentioned non-transitory computer-readable storage medium.

[0039] This application has at least the following beneficial effects:

[0040] The task allocation method provided by the present application, first, if at least two target executors are determined from a number of task executors, here, the target executors are pre-set with a preset working time period and a preset execution location, and the preset working time period pre-set by the target executors overlaps at least partially with the time period to be executed corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executors is the same as the execution location to be executed corresponding to the task to be assigned. That is, at least two target executors who are more suitable for the task to be assigned are determined from a number of task executors. Then, the priority corresponding to each target executor is obtained, where the priority represents the matching degree between the target executor and the task to be assigned. The higher the priority of the target executor, the higher the matching degree between the target executor and the task to be assigned, and vice versa. Finally, the prompt information corresponding to the task to be assigned is sent in order from high to low according to the priority corresponding to each target executor, until any target executor determines to execute the above-mentioned task to be assigned. Compared with the relevant technology, the present application is allocated according to the priority of the target executor, rather than directly sending it to all task executors, which saves server resource occupancy, and can match the user with a more suitable target executor as much as possible, thereby improving user satisfaction. Furthermore, the executors will not receive all the tasks to be assigned, but only the tasks that are most suitable for them, thus saving the time of task screening. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0042] Figure 1 A flowchart of a task allocation method provided by an embodiment of the present application;

[0043] Figure 2 A structural block diagram of a task allocation device provided in one embodiment of the present application. DETAILED DESCRIPTION

[0044] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of this application.

[0045] like Figure 1As shown, an embodiment of the present application provides a task allocation method, the method comprising:

[0046] Step S100, if at least two target executors are determined from a number of task executors, the priority corresponding to each target executor is obtained; wherein the above-mentioned priority represents the degree of matching between the target executor and the task to be assigned; the above-mentioned target executor is pre-set with a preset working time period and a preset execution location, and the preset working time period pre-set by the target executor at least partially overlaps with the to-be-executed time period corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the task to be assigned.

[0047] Specifically, the user places an order through the medical companion platform, and the medical companion platform generates a task to be assigned. The above-mentioned task to be assigned has corresponding task information. The task information corresponding to the task to be assigned includes: the time period to be executed corresponding to the task to be assigned, and the place to be executed corresponding to the task to be assigned. As an example, the task information of the task to be assigned is: 3:00-4:00 pm on November 18, 2024, and the location is Peking University Third Hospital. The task executor can be a service personnel registered on the medical companion platform, and can receive the prompt information corresponding to the task to be assigned to decide whether to determine the execution of the above-mentioned task to be assigned. Here, each task executor may not set a preset working time period and a preset execution location, or may only set a preset working time period or a preset execution location, or may set both a preset working time period and a preset execution location. As an example: Task executor A, its corresponding preset execution information is: Available to work at Peking University Third Hospital from 1:00-5:00 pm on November 18, 2024.

[0048] In one embodiment, the task information of the above-mentioned task to be assigned may also include a service type, and each task executor may also set a preset executable task type. As an example: the task information of the task to be assigned is: the task type is accompanying medical service, the time is 3:00-4:00 pm on November 18, 2024, and the location is Peking University Third Hospital. Task executor A, whose corresponding preset execution information is: from 1:00 to 5:00 pm on November 18, 2024 at Peking University Third Hospital, can undertake accompanying medical service (preset executable task type) and proxy consultation (preset executable task type) services.

[0049] However, the above-mentioned target executor is pre-set with a preset working time period and a preset execution location, and the preset working time period pre-set by the target executor at least partially overlaps with the time period to be executed corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executor is the same as the location to be executed corresponding to the task to be assigned; that is, the target executor is a task executor with a higher degree of adaptability to the task to be assigned among a number of task executors.

[0050] Then, the priority of each target executor is obtained, where the priority represents the matching degree between the target executor and the task to be assigned.

[0051] It is understandable that the priority corresponding to each target executor can be obtained according to the attribute label preset by each target executor.

[0052] Specifically, the preset attribute tags include first-category attribute tags and second-category attribute tags; wherein the first-category attribute tags are tags corresponding to the personalized information of the task to be assigned; and the second-category attribute tags are tags irrelevant to the personalized information of the task to be assigned.

[0053] Among them, according to the preset attribute label of each target executor, the priority corresponding to each target executor is obtained, which also includes:

[0054] Step a1, obtaining personalized information corresponding to the task to be assigned.

[0055] Here, the personalized information of the user corresponding to the task to be assigned is obtained, wherein the personalized information of the user includes G 1 , G 2 , …, G i , …, G n ; i = 1, 2, ..., n; where n is the number of personalized information of the user; G i is the ith personalized information of the user. As an example: the personalized information of the user may be the hospital to be treated, the department to be treated, the time of treatment, the age group and gender of the accompanying personnel required, whether to give priority to the task performers who have served before, etc.

[0056] Step a2: obtaining a first priority according to the personalized information corresponding to the task to be assigned and each first-category attribute label.

[0057] Here, the first type of attribute labels are labels corresponding to the tasks to be assigned, including: 1 , Y 2 , …, Y i , …, Y n Among them, Y i G iCorresponding attribute tags. For example, the first type of attribute tags can be: department of expertise, age, gender, whether the corresponding user has been served, etc.

[0058] In one embodiment, the first priority level YJ can be determined in the following manner: YJ=a / n; wherein a is the number of personalized information corresponding to the task to be assigned and the number of personalized information corresponding to the corresponding first-category attribute tags; here, the more personalized information corresponding to the task to be assigned and the number of personalized information corresponding to the corresponding first-category attribute tags, the more the target executor meets the needs of the user corresponding to the task to be assigned.

[0059] In another embodiment, the user's personalized information is divided into two categories. The first category of personalized information is non-user input information, namely, the hospital, department, time of consultation, etc., which is objective and true information corresponding to the task to be assigned. The second category of personalized information is user input information, including the age group, gender, and whether to give priority to task executors who have served before of the required accompanying personnel, etc., which is personalized information selected by the user according to his or her own wishes.

[0060] The first priority level YJ can be determined in the following way: YJ = α(b1 / n1) + β(b2 / n2); wherein n1 is the number of first-category personalized information, and n2 is the number of second-category personalized information; n1+n2=n; b1 is the number of first-category personalized information corresponding to the task to be assigned and the corresponding first-category attribute label corresponding to each other; b2 is the number of second-category personalized information corresponding to the task to be assigned and the corresponding second-category attribute label corresponding to each other; α is the first weight; β is the second weight. In this embodiment, α+β=1, and α>β; this is because the user's input information is closer to the user's real needs, so in order to improve the user experience, this embodiment gives a higher weight corresponding to the personalized information input by the user.

[0061] Step a3: obtaining a second priority according to each second-category attribute label and a preset mapping table.

[0062] Here, the second type of attribute labels are objectively formed labels, including E 1 , E 2 , …, E j , …, E m ; j = 1, 2, ..., m; where m is the number of the second category labels, E j is the jth second-category label; as an example: the second-category label can be a partial label such as complaint rate, praise rate, etc. that is irrelevant to the personalized information of the task to be assigned.

[0063] The preset mapping table includes each second-class attribute tag and the second priority corresponding to each second-class attribute tag. m j＝1 EP j / EZ; where 1 EP j For E j Corresponding score; EZ is the sum of the highest scores of m second-category attribute tags; as an example: m = 2, the second-category attribute tags include complaint rate and favorable rate, the complaint rate of task executor B is 5%, and the favorable rate is 80%, while in the preset mapping table, the complaint rate of 1%-10% corresponds to a score of 80, and the highest score is 100. The favorable rate of 70%-80% corresponds to a score of 80, and the highest score is 100. As an example: the second priority EJ = (80+80) / 200

[0064] S240: Obtain the priority level corresponding to each target executor according to the first priority level and the second priority level.

[0065] Here, in one embodiment, the first priority and the second priority are directly summed to obtain the priority corresponding to each target executor. In another embodiment, the first priority and the second priority are weightedly summed to obtain the priority corresponding to each target executor. This is not limited here.

[0066] Step S200, the prompt information corresponding to the task to be assigned is sent in descending order according to the priority corresponding to each target executor, until any target executor decides to execute the task to be assigned; wherein the prompt information is used to prompt the user to determine whether to execute the task to be assigned.

[0067] Specifically, the prompt information corresponding to the task to be assigned is sent in descending order according to the priority of each target executor, until any target executor determines to execute the task to be assigned. Compared with the related art, this embodiment assigns tasks according to the priority of the target executor, rather than directly sending them to all task executors, which saves server resources and can match users with more suitable target executors as much as possible, thereby improving user satisfaction. Moreover, for executors, they will not receive all the tasks to be assigned, but only the tasks with a high degree of suitability, which saves task screening time.

[0068] In an exemplary embodiment of the present application, the target executor meets the following conditions:

[0069] The preset available working time period pre-set by the target executor at least partially overlaps with the execution time period corresponding to the task to be assigned; and / or

[0070] The preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the to-be-assigned task; and

[0071] Any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned.

[0072] In this embodiment, any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned. Among them, the preset executable task types are services such as accompanying a doctor, consulting on behalf of a doctor, and running errands on behalf of a doctor. The preset executable task types can be dynamically added, deleted, and adjusted according to the scene conditions. No specific limitation is made here, that is, the target executor can set one or more preset executable task types. In this embodiment, any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned, that is, the target executor can handle tasks such as the task to be assigned. Furthermore, the preset working time period pre-set by the target executor overlaps at least partially with the time period to be executed corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executor is the same as the place to be executed corresponding to the task to be assigned. That is, on the basis of the same task type corresponding to the task to be assigned, the target person is also provided with a preset working time period and a preset execution location, and at least one of them needs to correspond to the time period to be executed or the place to be executed of the corresponding task to be assigned, so as to serve as the target executor.

[0073] In an exemplary embodiment of the present application, the target executor meets the following conditions:

[0074] The preset available working time period pre-set by the target executor at least partially overlaps with the to-be-executed time period corresponding to the to-be-assigned task; and

[0075] The preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the to-be-assigned task; and

[0076] Any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned.

[0077] In this embodiment, the target executor pre-sets a preset workable time period, a preset execution location, and a preset executable task type, and the preset workable time period pre-set by the target executor overlaps at least partially with the to-be-executed time period corresponding to the task to be assigned, the preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the task to be assigned, and any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned. In this embodiment, the target executor is highly adapted to the task to be assigned in terms of time, location, and type.

[0078] In an exemplary embodiment of the present application, step S200 includes:

[0079] Step S210, setting the target executor with the highest current priority as the current executor.

[0080] Specifically, the higher the priority, the higher the compatibility of the corresponding target executor with the task to be executed. Therefore, in this embodiment, the target executor with the highest current priority is first set as the current executor.

[0081] Step S220, assigning the task to be assigned to the current executor.

[0082] Step S230, if the current executor does not determine to execute the above-mentioned task to be assigned within the preset response time, the current executor is deleted and jumps to the step of "setting the target executor with the highest current priority as the current executor" until the current executor determines to execute the above-mentioned task to be assigned.

[0083] Specifically, if the current executor does not determine to execute the above-mentioned task to be assigned within the preset response time, the current executor will be deleted, and the target executor ranked second will be determined as the current executor in descending order of priority, and then the task to be assigned will be assigned to the current executor. If the above-mentioned task to be assigned is determined to be executed, the process ends; if the task to be assigned is not determined to be executed, the process continues, and the target executor ranked third will be determined as the current executor, and so on, until the current executor determines to execute the above-mentioned task to be assigned.

[0084] It should be noted that the preset response time can be 10 minutes. The preset response time can be dynamic. The preset response time is adjusted according to the amount of tasks in the time period to be executed corresponding to the assigned tasks. If the amount of tasks in the time period to be executed corresponding to the assigned tasks is large, the preset response time is extended. Otherwise, the preset response time is shortened.

[0085] In this embodiment, the tasks to be assigned are sent to each target executor in sequence according to the order of priority from high to low. Compared with the method of sending the tasks to multiple task executors at the same time, this saves server resource usage and improves service efficiency.

[0086] In an exemplary embodiment of the present application, step S200 includes:

[0087] Step S240, according to the order of priority from high to low, set the target execution personnel with a preset number in front as the current execution group.

[0088] Step S250, assigning the task to be assigned to each target executor of the current execution group.

[0089] Step S260, if within the preset response time, each target executor of the current execution group has not determined to execute the above-mentioned task to be assigned, the current execution group will be deleted and the process will jump to the step of "setting a preset number of target executors in front as the current execution group in order of priority from high to low" until any target executor determines to execute the above-mentioned task to be assigned.

[0090] In this embodiment, the groups are grouped according to the order of priority from high to low. For example, if there are 9 target executors, each group of three is divided into three groups, and the target executors ranked 123 are the first group, the target executors ranked 456 are the second group, and the target executors ranked 789 are the third group. Then, the task to be assigned is assigned to each target executor in the first group; if each target executor in the current execution group has not determined to perform the above-mentioned task to be assigned within the preset response time, the task to be assigned is assigned to each target executor in the second group, and so on. Until any target executor determines to perform the above-mentioned task to be assigned.

[0091] Compared with the previous embodiment, this embodiment replaces sending one by one with sending in groups, thereby improving the response speed.

[0092] In an exemplary embodiment of the present application, after sending the prompt information corresponding to the task to be assigned in order of priority from high to low for each target executor, the method further includes:

[0093] Step S300, if each target executor has not determined to execute the above-mentioned task to be assigned, then a number of preset areas are obtained with the execution location corresponding to the task to be assigned as the center and different preset distances as the radius; wherein any two adjacent preset areas do not overlap.

[0094] Specifically, if each target executor has not determined to execute the above-mentioned task to be assigned, the second stage of distribution of the task to be assigned is entered, and several preset areas are obtained, each preset area has a corresponding radius; and there is no overlapping area between any two adjacent preset areas.

[0095] Step S400: determining a preset area with the smallest preset distance as the current area to be allocated.

[0096] Specifically, the preset area with the shortest preset distance is the preset area closest to the execution location among all preset areas. The task executors here may be at the execution location or at other nearby locations. The tasks to be assigned are distributed preferentially according to the preset area with the shortest distance. On the one hand, for users, the response speed may be faster, which improves the experience. On the other hand, for service personnel, it is not certain that all tasks will be executed, and they need to screen the tasks that they can be sure to execute. They receive orders that are closer, which saves the screening steps and improves the efficiency of task determination and execution.

[0097] Step S500, sending the above-mentioned task to be assigned to each key executor in the current area to be assigned except the target executor; wherein the above-mentioned key executor is pre-set with a preset execution location and at least one preset executable task type; the above-mentioned key executor is determined from a number of task executors; any preset executable task type corresponding to the above-mentioned key executor is the same as the task type corresponding to the task to be assigned.

[0098] Step S600, if each key executor except the target executor in the current area to be assigned has not determined to perform the above-mentioned task to be assigned, the above-mentioned current area to be assigned is deleted, and jump to the step of "determining the preset area with the smallest preset distance as the current area to be assigned" until any key executor determines to perform the above-mentioned task to be assigned.

[0099] In this embodiment, if several selected target executors have not determined to execute the task to be assigned, the task to be assigned is distributed to each preset area in order from small to large according to the preset distance, until any key executor other than the target executor determines to execute the above-mentioned task to be assigned. By distributing from near to far distance, the number of people distributed each time is reduced compared to sending it to each key executor at the same time, saving server resources. In addition, for service personnel, they will not receive every task to be assigned, so they need to screen the tasks they can determine to execute from a large number of tasks. The tasks that are determined to be executed are processed layer by layer, which improves the efficiency of task determination and execution. Save processing time.

[0100] It should be noted that the maximum radius corresponding to the preset area is the preset radius. The preset radius can be determined, for example, it can be 10 km. And the task execution personnel assigned in this embodiment are all task execution personnel within the administrative area.

[0101] It is understandable that the key executor may be a task executor with a preset execution location and at least one preset executable task type, and any preset executable task type corresponding to the key executor is the same as the task type corresponding to the task to be assigned and / or the same preset execution location, or may be a task executor with a preset execution location, a preset working time period and at least one preset executable task type, and any preset executable task type corresponding to the key executor is the same as the task type corresponding to the task to be assigned and / or the same preset execution location. There is no time limit.

[0102] In an exemplary embodiment of the present application, the preset executable task type is mandatory information for each task executor, and the preset working time period and preset execution location are non-mandatory information for each task executor; if each key executor in each preset area of ​​a plurality of preset areas has not determined to execute the above-mentioned task to be assigned, the above-mentioned method further includes:

[0103] Step S700, sending the prompt information corresponding to the task to be assigned to each key executor and each executable person in the preset administrative area corresponding to the task to be assigned except for several preset areas, wherein the above-mentioned executable person is a task executor for whom non-mandatory information is not set.

[0104] Specifically, if there is still no one in the preset area corresponding to the maximum radius who is determined to execute the above-mentioned task to be assigned, the task to be assigned will be sent to each key executor and each task executor in the preset administrative area corresponding to the task to be assigned, except for several preset areas. Here, the above-mentioned task executors do not have non-mandatory information set.

[0105] In this embodiment, when no one is determined to execute the above-mentioned to-be-assigned task in the preset area corresponding to the maximum radius, the sending range of the to-be-assigned task is further expanded, and the task is sent to each key executor and executable person in the preset administrative area who has not been sent before, thereby increasing the possibility of the to-be-assigned task being determined to be executed and improving the user experience. Ensure the confirmed execution rate of the to-be-assigned task.

[0106] In addition, although the steps of the method in the present application are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0107] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the implementation method of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, an AI terminal, an embodied intelligent robot or a network device, etc.) to execute the method according to the implementation method of the present application.

[0108] Please refer to Figure 2 As shown, an embodiment of the present application provides a task allocation device 100, the device comprising:

[0109] The priority determination unit 110 is used to obtain the priority corresponding to each target executor if at least two target executors are determined from a number of task executors; wherein the above-mentioned priority represents the matching degree between the target executor and the task to be assigned; the above-mentioned target executor is pre-set with a preset working time period and a preset execution location, and the preset working time period pre-set by the target executor at least partially overlaps with the to-be-executed time period corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the task to be assigned.

[0110] The task assignment unit 120 is used to send the prompt information corresponding to the task to be assigned in order of priority corresponding to each target executor from high to low until any target executor decides to execute the above-mentioned task to be assigned; wherein the above-mentioned prompt information is used to prompt the user to determine whether to execute the above-mentioned task to be assigned.

[0111] In an exemplary embodiment of the present application, an electronic device capable of implementing the above method is also provided.

[0112] Those skilled in the art will appreciate that various aspects of the present application may be implemented as a system, method or program product. Therefore, various aspects of the present application may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to as "circuit", "module" or "system" herein.

[0113] The electronic device according to this embodiment of the present application is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0114] The electronic device is presented in the form of a general-purpose computing device. The components of the electronic device may include, but are not limited to: the at least one processor mentioned above, the at least one storage device mentioned above, and a bus connecting different system components (including storage devices and processors).

[0115] The storage device stores program codes, which can be executed by the processor, so that the processor executes the steps described in the “exemplary method” section of the specification according to various exemplary embodiments of the present application.

[0116] The memory may include readable media in the form of volatile memory, such as random access memory (RAM) and / or cache memory, and may further include read only memory (ROM).

[0117] The storage may also include a program / utility having a set (at least one) of program modules, such program modules including but not limited to: an operating system, one or more application programs, other program modules and program data, each of which or some combination may include the implementation of a network environment.

[0118] The bus may represent one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.

[0119] The electronic device may also communicate with one or more external devices (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may communicate with one or more devices that enable a user to interact with the electronic device, and / or may communicate with any device (e.g., routers, modems, etc.) that enables the electronic device to communicate with one or more other computing devices. Such communication may be performed through an input / output (I / O) interface. Furthermore, the electronic device may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) through a network adapter. The network adapter communicates with other modules of the electronic device through a bus. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.

[0120] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the implementation methods of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation methods of the present application.

[0121] In an exemplary embodiment of the present application, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present application can also be implemented in the form of a program product, which includes a program code. When the above program product is run on a terminal device, the above program code is used to enable the above terminal device to execute the steps according to various exemplary implementations of the present application described in the above "Exemplary Method" section of the present specification.

[0122] The above-mentioned program product can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but not limited to, a system, device or device of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0123] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0124] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0125] Program code for performing the operations of the present application may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0126] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present application, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.

[0127] It should be noted that, although several modules or units of the equipment for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.

[0128] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A task allocation method, characterized in that: The method comprises: If at least two target executors are determined from a number of task executors, the priority corresponding to each target executor is obtained; wherein the priority indicates the degree of matching between the target executor and the task to be assigned; the target executor is pre-set with a preset available working time period and a preset execution location, and the preset available working time period pre-set by the target executor at least partially overlaps with the to-be-executed time period corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the task to be assigned; The prompt information corresponding to the task to be assigned is sent in descending order according to the priority corresponding to each target executor until any target executor decides to execute the task to be assigned; wherein the prompt information is used to prompt the user to determine whether to execute the task to be assigned.

2. The task allocation method according to claim 1, characterized in that: The target executives meet the following conditions: The preset available working time period pre-set by the target executor at least partially overlaps with the execution time period corresponding to the task to be assigned; and / or The preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the to-be-assigned task; and Any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned.

3. The task allocation method according to claim 2, characterized in that: The target executive personnel meet the following conditions: The preset available working time period pre-set by the target executor at least partially overlaps with the to-be-executed time period corresponding to the to-be-assigned task; and The preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the to-be-assigned task; and Any preset executable task type pre-set by the target executor is the same as the task type corresponding to the task to be assigned.

4. The task allocation method according to any one of claims 1 to 3, characterized in that: The prompt information corresponding to the task to be assigned is sent in descending order of priority of each target executor until any target executor determines to execute the task to be assigned, including: Set the target executor with the highest current priority as the current executor; Assign pending tasks to current executors; If the current executor does not determine to execute the task to be assigned within the preset response time, the current executor is deleted and the process jumps to step "setting the target executor with the highest current priority as the current executor" until the current executor determines to execute the task to be assigned.

5. The task allocation method according to any one of claims 1 to 3, characterized in that: The prompt information corresponding to the task to be assigned is sent in descending order of priority of each target executor until any target executor determines to execute the task to be assigned, including: According to the order of priority from high to low, the preset number of target executors in the front are set as the current execution group; Allocate the tasks to be assigned to each target executor of the current execution group; If within the preset response time, each target executor of the current execution group has not confirmed to execute the task to be assigned, the current execution group will be deleted and the process will jump to step "set a preset number of target executors as the current execution group in order of priority from high to low" until any target executor confirms to execute the task to be assigned.

6. The task allocation method according to claim 3, characterized in that: After sending the prompt information corresponding to the task to be assigned in the order of priority corresponding to each target executor from high to low, the method further includes: If each target executor has not determined to execute the task to be assigned, a number of preset areas are obtained with the execution location corresponding to the task to be assigned as the center and different preset distances as the radius; wherein any two adjacent preset areas do not overlap; Determine the preset area with the smallest preset distance as the current area to be allocated; Sending the task to be assigned to each key executor except the target executor in the current area to be assigned; wherein the key executor is pre-set with a preset execution location and at least one preset executable task type; the key executor is determined from a number of task executors; any preset executable task type corresponding to the key executor is the same as the task type corresponding to the task to be assigned; If each key executor except the target executor in the current area to be assigned has not determined to perform the task to be assigned, the current area to be assigned is deleted and the process jumps to step "determining the preset area with the smallest preset distance as the current area to be assigned" until any key executor determines to perform the task to be assigned.

7. The task allocation method according to claim 6, characterized in that: The preset executable task type is mandatory information for each task executor, and the preset available working time period and preset execution location are optional information for each task executor; If each key executive in each of the plurality of preset areas has not been determined to perform the task to be assigned, the method further includes: The prompt information corresponding to the task to be assigned is sent to each key executor and each executable person in the preset administrative area corresponding to the task to be assigned, except for several preset areas, wherein the executable person is a task executor for which non-mandatory information is not set.

8. A task allocation device, characterized in that: The device comprises: A priority determination unit, for obtaining the priority corresponding to each target executor if at least two target executors are determined from a number of task executors; wherein the priority indicates the degree of matching between the target executor and the task to be assigned; the target executor is pre-set with a preset available working time period and a preset execution location, and the preset available working time period pre-set by the target executor at least partially overlaps with the to-be-executed time period corresponding to the task to be assigned; and / or the preset execution location pre-set by the target executor is the same as the to-be-executed location corresponding to the task to be assigned; The task assignment unit is used to send the prompt information corresponding to the task to be assigned in the order of priority corresponding to each target executor from high to low, until any target executor decides to execute the task to be assigned; wherein the prompt information is used to prompt the user to determine whether to execute the task to be assigned.

9. A non-transitory computer-readable storage medium, wherein at least one instruction or at least one program is stored in the storage medium, characterized in that: The at least one instruction or the at least one program is loaded and executed by the processor to implement the method according to any one of claims 1 to 7.

10. An electronic device, characterized in that: The invention comprises a processor and the non-transitory computer-readable storage medium as claimed in claim 9.

Images