Task allocation method, electronic device, and computer-readable storage device

Abstract

This application discloses a task allocation method. The method includes: obtaining user information, determining a target task pool and the number of tasks based on the user information; generating a task query statement based on the number of tasks assigned to each target task pool and preset priority configuration information; searching for tasks in each target task pool according to the task query statement, and assigning the searched tasks to the system corresponding to the user information. This application also discloses an electronic device and a computer-readable storage device. Through the above-mentioned methods, this application can reduce the amount of code required to implement the integrated allocation of tasks in different systems.

Description

Technical Field

[0001] The present application relates to the field of data processing, and in particular to a task allocation method, an electronic device, and a computer-readable storage device. Background Art

[0002] To ensure smooth work execution, modern organizations typically establish a comprehensive task process system. This process can include a series of steps, including task generation, task assignment, task execution, and task feedback. Large organizations may establish multiple task process systems based on the specific tasks and the departments responsible for handling them. These systems may have slightly different task processes. As organizations increasingly adopt centralized management, they typically centralize the receipt and assignment of work tasks. However, the tasks generated by different task process systems vary. Therefore, how to integrate and allocate tasks across these systems to improve the efficiency of task storage and assignment has become a pressing issue. Summary of the Invention

[0003] The main purpose of this application is to provide a task allocation method, electronic device and computer-readable storage device, which can solve the technical problem of integrating and allocating tasks in different systems.

[0004] To solve the above technical problems, the first technical solution adopted in this application is to provide a task allocation method. The method includes: obtaining user information, determining a target task pool and the number of tasks based on the user information; generating a task query statement based on the number of tasks assigned to each target task pool and preset priority configuration information; searching for tasks in each target task pool according to the task query statement, and allocating the searched tasks to the system corresponding to the user information.

[0005] To solve the above technical problem, the second technical solution adopted in this application is to provide an electronic device. The electronic device includes a memory and a processor, wherein the memory is used to store program data, and the program data can be executed by the processor to implement the method described in the first technical solution.

[0006] To solve the above technical problems, the third technical solution adopted by this application is to provide a computer-readable storage device that stores program data and can be executed by a processor to implement the method described in the first technical solution.

[0007] The beneficial effects of the present application are as follows: the present application obtains the user's information, determines the task pool from which tasks can be extracted and the number of tasks required by the user, and further calculates the number of tasks that can be extracted from each task pool. After determining the number of tasks that can be extracted in the task pool, a task query statement is generated in combination with the preset priority configuration information, and the tasks in the task pool are screened through the task query statement to obtain the final task. The final task is assigned to the system corresponding to the user information. In the present application, tasks all correspond to priority configuration information, so that tasks are operated in accordance with a unified priority configuration standard during input and query assignment, and the priority configuration standard is further corresponded to the query statement in the database. The unified code implementation for task query reduces the amount of code that needs to be set when integrating and assigning tasks in different systems, thereby improving the working performance of the integrated system. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0009] Figure 1 This is a flowchart of the first embodiment of the task allocation method of this application;

[0010] Figure 2 This is a flow chart of the second embodiment of the task allocation method of this application;

[0011] Figure 3 It is a schematic diagram of configuration priority configuration information;

[0012] Figure 4 This is a flowchart of the third embodiment of the task allocation method of this application;

[0013] Figure 5 This is a flowchart of the fourth embodiment of the task allocation method of the present application;

[0014] Figure 6 This is a flowchart of the fifth embodiment of the task allocation method of the present application;

[0015] Figure 7 This is a structural diagram of an embodiment of an electronic device of the present application;

[0016] Figure 8 It is a structural diagram of an embodiment of a computer-readable storage device of the present application;

[0017] Figure 9 It is a structural diagram of an embodiment of the electronic device of the present application. DETAILED DESCRIPTION

[0018] The following will be combined with the drawings in the embodiments of this application to clearly and completely describe the technical solutions in the embodiments of this application. Obviously, the embodiments described are only part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0019] The terms "first," "second," and the like in this application are used to distinguish between different objects, not to describe a particular order. Furthermore, the terms "including," "having," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or elements is not limited to the listed steps or elements, but may optionally include steps or elements not listed, or may optionally include other steps or elements inherent to the process, method, product, or apparatus.

[0020] References herein to "embodiments" mean that a particular feature, structure, or characteristic described in connection with the embodiments may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor does it constitute an independent or alternative embodiment that is mutually exclusive of other embodiments. It is understood, both explicitly and implicitly, by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0021] Reference Figure 1 , Figure 1 This is a flow chart of the first embodiment of the task allocation method of this application. It includes the following steps:

[0022] S11: Obtain user information, and determine the target task pool and the number of tasks based on the user information.

[0023] In order to assign tasks to users in different systems, or most directly to different systems, it is necessary to first obtain relevant information about the lower-level systems so that the upper-level system used for integration can perform corresponding task assignments to the different lower-level systems based on this information. User information may include information about the user and information about the system to which the user corresponds. User information includes user permission information, and system information includes system permission information. System permission information can be determined based on the permission information of users in the system. Permission information indicates the level of tasks that the user or system can obtain. Only those who have reached the corresponding permissions can obtain tasks of the corresponding level. Task levels can be determined based on various aspects of information, such as the priority of the task, the importance of the target user of the task, and the difficulty of the task. The integration system divides all tasks based on this information to obtain a task pool containing tasks of different levels. The integration system further determines the target task pool for task assignment based on the permission information, and determines the number of tasks that can be received or the number of tasks to be assigned corresponding to the user information or system information.

[0024] S12: Generate a task query statement based on the number of tasks allocated to each target task pool and preset priority configuration information.

[0025] The number of tasks in each target task pool is determined by determining the target task pool and the number of tasks to be assigned. The task query statement for querying the task pool is determined based on the preset priority configuration information and the number of tasks. Priority configuration information integrates various attribute information uniformly set for all tasks by the task system, used to classify tasks and facilitate the division, integration, and query allocation of all received tasks.

[0026] In one embodiment, suppose a user wishes to retrieve tasks that are not part of the current system, must match their own tags, involve an amount greater than 10,000 yuan, and prioritize tasks that are about to expire. The corresponding priority configuration information for the task query should be: 1. Tasks not part of the current system; 2. Tasks that match their own tags; 3. Task amounts greater than 10,000 yuan; 4. Prioritize tasks that are about to expire. Furthermore, suppose the user's system is 0200A, their tag is TAG1, and they need to retrieve five tasks. The above priority configuration information can be converted into an ES query statement. The "equal to," "not equal to," or range query conditions in the priority configuration information correspond to queries such as must-terms, must_not-terms, and range in the ES query statement. For complex configuration conditions such as retrieval of tasks that are not part of the current system or tasks that are part of the current system, ES query statement templates can be pre-configured so that when encountering similar configuration information, these templates can be directly invoked to convert the configuration conditions into query statements.

[0027] S13: Search for tasks in each target task pool according to the task query statement, and assign the searched tasks to the system corresponding to the user information.

[0028] After determining the task query statement, the corresponding target task pool is searched based on the task query statement to determine the tasks in each target task pool that can be assigned to the user or the user's corresponding system, and then assign them to the user's corresponding system.

[0029] In this embodiment, by obtaining the user's information, the task pool from which tasks can be extracted and the number of tasks required by the user are determined, and the number of tasks that can be extracted from each task pool is further calculated. After determining the number of tasks that can be extracted in the task pool, a task query statement is generated in combination with the preset priority configuration information, and the tasks in the task pool are screened by the task query statement to obtain the final task. The final task is assigned to the system corresponding to the user information. In this application, the tasks all correspond to the priority configuration information, so that the tasks are operated in accordance with the unified priority configuration standard when input and query allocation are performed, and the priority configuration standard is further corresponded to the query statement in the database, thereby realizing a unified code implementation for task query, reducing the amount of code that needs to be set when integrating and allocating tasks in different systems, and improving the working performance of the integrated system.

[0030] Reference Figure 2 , Figure 2 This is a flow chart of the second embodiment of the task allocation method of this application. The method is to set priority configuration information. It includes the following steps:

[0031] S21: Configure task constraints and / or task sorting conditions for each task pool.

[0032] Before querying the tasks in the task pool, you need to set the priority configuration information for each task pool. Figure 3 As shown, first, set the task constraints and task sorting conditions related to the task. If no conditions exist, you do not need to set them. Task constraints are used to filter tasks in the task pool and exclude those that do not meet the conditions. Task sorting conditions are used to prioritize the remaining tasks, prioritizing them based on the set conditions to select at least one task with the highest priority.

[0033] S22: Further configuring task attributes and / or user attributes in the task restriction conditions and / or task sorting conditions.

[0034] Task constraints and sorting conditions further allow you to select the task attributes you want to restrict or sort. Task attributes are information related to the assigned task. For example, in task constraints, you can select the system to which the task belongs, the task's tags, and the task type into which the task is classified. User attributes are information related to the user or the system to which the user corresponds. Figure 3 The target attributes are displayed in the middle. For example, the system or organization to which the user belongs, the user's tags, etc.

[0035] S23: Generate priority configuration information based on task constraints, and / or task sorting conditions, and task attributes and / or user attributes.

[0036] Each task attribute or each task attribute and its corresponding user attribute constitutes a task constraint condition or a task sorting condition. The task sorting condition and the task constraint condition together constitute the priority configuration information for the task pool, which is used to screen and sort tasks in the task pool.

[0037] Reference Figure 4 , Figure 4 This is a flow chart of the third embodiment of the task allocation method of this application. This method is a further extension of the second embodiment. It includes the following steps:

[0038] S31: In response to a configuration condition command, generate a task attribute to be configured and at least one selection condition corresponding to the task attribute to be configured.

[0039] When priority configuration information needs to be configured, in response to the configuration command, a task attribute to be configured and a selection condition corresponding to the task attribute to be configured are first generated. The selection condition includes whether it is related to the user attribute. In the case of actual task selection, its configuration information may be related to the user's own information. For example, the task is consistent with the user tag, the task is not a task in this system, and so on. Therefore, after selecting the attribute of the task in the condition, it is necessary to further determine whether it is a condition related to the user attribute. Conditions related to user attributes require further introduction of user attributes during configuration.

[0040] S32: Determine the attributes of the user to be configured based on the attributes of the task to be configured and at least one selection condition.

[0041] Determine whether the user attributes to be configured need to be set based on the attributes of the task to be configured and the selection conditions in the conditions. If the task attributes configured in the condition are related to the user attributes, the selection condition is related to the user attributes, and the user attributes corresponding to the configured task attributes will be further generated in the condition. For example, if the condition for obtaining the task in the priority configuration information is that the task is not in this system, then in the task restriction condition, its task attribute selects the system to which the task belongs, and its selection condition selects related to the user attributes. The corresponding condition will further generate the user attributes to be configured and the selection condition of whether it is equal to. After the user selects the system to which he belongs in the user attributes to be configured, and selects the not equal to condition, the establishment of the screening condition for the task not being in this system in the priority configuration information is completed.

[0042] If the task attribute configured in the condition is unrelated to the user attribute, the condition will not generate the user attribute to be configured. Instead, it will generate other selection conditions such as values ​​and ranges. For example, after the user selects a task type, the task type is unrelated to the user attribute. The condition continues to select the equal or not equal condition and the pre-set task type to generate the conditions for obtaining or not obtaining a certain type of task in the priority configuration information.

[0043] The attribute fields used to configure task attributes are pre-stored in the cache. When configuring, the stored attribute fields can be directly selected and called through the drop-down window bar as shown in the figure. The attribute fields used to configure user attributes are also pre-stored in the cache. When configuring, the stored attribute fields can also be selected and called through the drop-down window bar. The attribute fields of task attributes and user attributes can be a collection of their corresponding attribute fields when the task is generated, or they can be preset in advance. All fields are set and organized in advance and put into the cache for subsequent selection. This allows even if a new task pool is added, it can directly apply the attribute fields of the task attributes and user attributes.

[0044] Reference Figure 5 , Figure 5 This is a flow chart of the fourth embodiment of the task allocation method of this application. This method is a further extension of step S12. It includes the following steps:

[0045] S41: Determine the number of tasks that need to be extracted from each target task pool.

[0046] After obtaining user information, the target task pools that can be used to allocate tasks to the user's corresponding system can be determined based on their corresponding permission information and the task level in the task pool. The number of tasks that can still be allocated in these target task pools and the number of tasks the user needs to obtain are calculated, and the number of tasks in each task pool that need to be allocated to the user's corresponding system is determined.

[0047] In one embodiment, according to the average distribution algorithm, after determining the upper limit of the number of tasks that each target task pool can allocate and the number of tasks required by the user, the number of tasks acquired by each target task pool is calculated so that the difference in the number of tasks allocated by each target task pool is minimized.

[0048] S42: Determine task restriction conditions and / or task sorting conditions of the task based on the priority configuration information of each target task pool.

[0049] Further, the corresponding priority configuration information is determined according to the different task pools. The priority configuration information includes the configured task constraints and / or task sorting conditions. The specific configuration process can refer to the above embodiment.

[0050] S43: Generate a task query statement according to the task restriction conditions and / or task sorting conditions of the task, and the number of tasks to be extracted.

[0051] For different target task pools, determine the query filter conditional statements based on their corresponding task restrictions and / or task sorting conditions, as well as the number of tasks. Convert the conditional restrictions, sorting, or quantity information into forms such as "equal to," "not equal to," or range queries to correspond to the query statements. For example, in ES query statements, they can be converted into query statements such as must-terms, must_not-terms, and range. Some complex conditions can also call pre-set query statement templates. After entering the corresponding relevant parameters, the conditions and query statements can be converted.

[0052] In practice, multiple users may request tasks simultaneously, so the number of tasks to be assigned in the task pool must be real-time data during calculations, otherwise allocation errors will occur. To ensure the accuracy of the number of tasks in each task pool, each task pool is calculated using a single thread when performing relevant calculations on the tasks in the task pool. Furthermore, before the calculation is performed, the task pool to be operated on is locked. Only after the lock is locked can the subsequent related logical operations be performed. This ensures that when each task pool performs relevant calculations, its data corresponds to the current calculation program flow and is not interrupted by other programs.

[0053] Reference Figure 6 , Figure 6 This is a flowchart of the fifth embodiment of the task allocation method of this application. This method is a further extension of the first embodiment. It includes the following steps:

[0054] S51: searching the cache for task numbers that match the task quantity in each target task pool according to the task restriction conditions and / or task sorting conditions in the task query statement.

[0055] The task numbers and corresponding task attributes of tasks in the task pool are stored in a cache when the task is generated, facilitating subsequent query and filtering when selecting or calling tasks. Priority configuration information includes configured task constraints and / or task sorting conditions, which in turn further include configured task attributes and / or user attributes. The attribute information of tasks in the cache is filtered based on the attribute information configured in the conditions to obtain the task numbers of tasks that meet the conditions.

[0056] S52: Obtain the corresponding task from the database based on the task number.

[0057] After obtaining the task number, the corresponding task information is retrieved from the database.

[0058] S53: Allocate the searched task to the system corresponding to the user information.

[0059] The retrieved task information is assigned to the system corresponding to the user information obtained when filtering tasks to achieve task allocation.

[0060] S54: The task status of the assigned task is updated in the database, and the task number of the assigned task is deleted from the buffer area.

[0061] After task assignment is complete, the status of the assigned task in the database is modified. For example, the pending status can be changed to the in-processing status, or further processed in System A. At the same time, the task number of the assigned task is deleted from the database to prevent duplicate processing of task data and waste of manpower and material resources.

[0062] Due to the large number of programs, there may be a situation in the database where multiple task programs operate on the same task data at the same time, thereby causing the problem of dirty data. In one embodiment, when the task status of a task in the database is updated, a pessimistic lock is applied to it, that is, after the task status is updated, the task status is checked again to prevent errors. Alternatively, an optimistic lock is applied to it, and the task status in the database is updated with the task status to avoid incorrect task status updates.

[0063] In the above embodiment, if tasks from multiple task pools are to be retrieved at once, in order to improve computing performance and save computing time, the task retrieval from each task pool can be processed asynchronously. Furthermore, in order to reduce the update time for these tasks, the update logic of each task can also be processed asynchronously.

[0064] If the user fails to obtain the expected number of tasks after the task allocation in the above embodiment, the task query and allocation may be automatically repeated, or the user may be prompted that the number of tasks meeting the conditions in the task pool is insufficient.

[0065] like Figure 7 As shown, Figure 7 This is a structural diagram of an embodiment of an electronic device of the present application.

[0066] The electronic device includes a processor 110 and a memory 120 .

[0067] The processor 110 controls the operation of the electronic device and may also be referred to as a CPU (Central Processing Unit). The processor 110 may be an integrated circuit chip with the ability to process signal sequences. The processor 110 may also be a general-purpose processor, a digital signal sequence processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component. The general-purpose processor may be a microprocessor or any conventional processor.

[0068] The memory 120 stores instructions and program data required for the processor 110 to operate.

[0069] The processor 110 is configured to execute instructions to implement the method provided by any embodiment and possible combination of the aforementioned task allocation method of the present application.

[0070] like Figure 8 As shown, Figure 8 This is a structural diagram of an embodiment of a computer-readable storage device of the present application.

[0071] An embodiment of the readable storage device of the present application includes a memory 210, and the memory 210 stores program data. When the program data is executed, the method provided by any embodiment and possible combination of the task allocation method of the present application is implemented.

[0072] The memory 210 may include a medium that can store program instructions, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, or it may be a server that stores the program instructions. The server may send the stored program instructions to other devices for execution, or it may execute the stored program instructions itself.

[0073] like Figure 9 As shown, Figure 9 This is a structural diagram of an embodiment of the electronic device of the present application.

[0074] The electronic device includes a task calculation module 310 , a priority query module 320 , a task process module 330 , an information acquisition module 340 and a control module 350 .

[0075] The task calculation module 310 is used for determining the target task pool and the number of tasks that need to be assigned to each target task pool based on the user information obtained and the preset priority configuration information. The priority query module 320 is used for generating a query statement based on the number of tasks in the target task pool and the conditions in the priority configuration information, thereby querying and screening the target task pool and obtaining the task numbers of the filtered tasks. The task flow module 330 is used for updating the task status of the assigned task in the database and deleting the task numbers of the assigned tasks from the buffer area. The information acquisition module 340 obtains the user information for querying the assigned tasks. The control module 350 connects the above modules to realize the method provided by any embodiment and possible combination of the task assignment method of the present application.

[0076] In summary, the present application obtains user information, determines the task pool from which tasks can be extracted and the number of tasks required by the user, and further calculates the number of tasks that can be extracted from each task pool. After determining the number of tasks that can be extracted in the task pool, a task query statement is generated in combination with the preset priority configuration information, and the tasks in the task pool are screened through the task query statement to obtain the final task. The final task is assigned to the system corresponding to the user information. In the present application, tasks all correspond to priority configuration information, so that tasks are operated in accordance with a unified priority configuration standard during input and query assignment, and the priority configuration standard is further corresponded to the query statement in the database. The unified code implementation for task query reduces the amount of code that needs to be set when integrating and assigning tasks in different systems, thereby improving the working performance of the integrated system.

[0077] In the several embodiments provided in this application, it should be understood that the disclosed methods and devices can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the modules or units is merely a logical functional division. In actual implementation, other division methods may be used, such as combining or integrating multiple units or components into another system, or ignoring or not implementing certain features.

[0078] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of this embodiment.

[0079] In addition, each functional unit in each embodiment of the present application may be integrated into a processing unit, each unit may exist physically separately, or two or more units may be integrated into a single unit. The above-mentioned integrated units may be implemented in the form of hardware or software functional units.

[0080] If the integrated units in the above other embodiments are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0081] The above description is merely an embodiment of the present application and does not limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A task allocation method, characterized in that: The method comprises: Obtain user information, and determine a target task pool and the number of tasks based on the user information; Generate task query statements based on the number of tasks assigned to each target task pool and preset priority configuration information; Searching for tasks in each target task pool according to the task query statement, and assigning the searched tasks to the system corresponding to the user information; The task allocation method further includes: Configure task constraints and / or task sorting conditions for each task pool; Further configuring task attributes and / or user attributes in the task restriction conditions and / or task sorting conditions; Generate the priority configuration information based on the task restriction conditions, and / or task sorting conditions, and task attributes and / or user attributes; The generating of the task query statement based on the number of tasks assigned to each target task pool and the preset priority configuration information includes: Determine the number of tasks that need to be extracted from each target task pool; Determining task restriction conditions and / or task sorting conditions of the tasks based on the priority configuration information of each target task pool; Generating the task query statement according to the task restriction conditions and / or task sorting conditions of the task and the number of tasks to be extracted; The step of searching for tasks in each target task pool according to the task query statement includes: According to the task restriction condition in the task query statement and / or the task sorting condition, searching the cache for the task number that matches the task quantity in each target task pool; Obtaining a corresponding task from a database based on the task number; Allocating the searched task to the system corresponding to the user information includes: The task status of the assigned task is updated in the database, and the task number of the assigned task is deleted from the buffer area.

2. The task allocation method according to claim 1, characterized in that: Updating the task status of the assigned task in the database includes: The task status of the task in the database is updated using optimistic locking or pessimistic locking.

3. The task allocation method according to claim 1, characterized in that: The task restriction conditions and / or task sorting conditions for configuring each task pool include: In response to the configuration condition command, generating a task attribute to be configured and at least one selection condition corresponding to the task attribute to be configured; Determining the attributes of the user to be configured based on the attributes of the task to be configured and the at least one selection condition; The task restriction condition and / or the task sorting condition are determined based on the attribute of the task to be configured, the at least one selection condition and / or the attribute of the user to be configured.

4. The task allocation method according to claim 3, characterized in that: The attribute fields used to configure the task attributes and the user attributes are pre-stored in a cache area so that they can be directly called when configuring the task attributes and the user attributes.

5. The task allocation method according to claim 1, characterized in that: Determining the number of tasks to be extracted from each target task pool includes: Determining the number of tasks to be assigned to each target task pool; The number of tasks to be extracted from each target task pool is determined based on the number of tasks to be assigned in each target task pool and the number of tasks determined based on the user information.

6. The task allocation method according to claim 5, characterized in that: Each target task pool performs a calculation operation through a single thread, and each target task pool is locked before the calculation operation.

7. An electronic device, characterized in that: The system comprises a memory and a processor, wherein the memory is used to store program data, and the program data can be executed by the processor to implement the method according to any one of claims 1 to 6.

8. A computer-readable storage device, characterized in that: Program data is stored and can be executed by a processor to implement the method according to any one of claims 1 to 6.

Images