Task management method, device and equipment and readable storage medium

Abstract

The invention discloses a task management method, device and equipment and a readable storage medium. A target graph input by a first user is received, nodes of all levels contained in the target graph are traversed, the node of the first level in the target graph is used as a starting point, and the node of the last level in the target graph is used as an ending point; and determining each demand path containing different hierarchical nodes, determining each propaganda information generation task according to the nodes contained in each demand path, and allocating each propaganda information generation task to each second user, so that each second user determines propaganda information according to the allocated propaganda information generation task. It can be seen that the target graph contains the nodes with the hierarchical relationship, and the demand details of the propaganda information can be completely covered, so that the accuracy of the propaganda information is enhanced. Moreover, the incidence relation between the nodes of different levels can be determined through the edges between the nodes in the target graph, so that the generation efficiency of the propaganda information is improved.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a task management method, device, equipment and readable storage medium. Background Art

[0002] With the development of Internet technology, merchants can be recommended to consumers by displaying their promotional information. For example, a promotional video of a merchant can be played on a mobile terminal, and consumers may purchase the goods or services provided by the merchant after watching the promotional video.

[0003] Among them, the publicity information design requirements refer to the specific requirements established when designing publicity information based on the merchant's publicity objectives, brand image, target audience and other information. After the publicity information design requirements are assigned to designers as publicity information generation tasks, designers can generate publicity information based on the publicity information design requirements to meet the merchant's requirements.

[0004] Currently, text descriptions or lists are usually used to record and manage promotional information design requirements.

[0005] However, in the above scheme, the method of using text to describe the design requirements of publicity information has the problem of difficulty in covering the details of the requirements, which easily leads to the omission of the required information. The method of recording the design requirements of publicity information in the form of a list has the problem of lack of logical connection between the various required information, thereby reducing the efficiency of generating publicity information. Summary of the invention

[0006] This specification provides a task management method, apparatus, device and readable storage medium to partially solve the above-mentioned problems existing in the prior art.

[0007] This manual adopts the following technical solutions:

[0008] This specification provides a task management method, including:

[0009] Obtaining a target graph input by a first user, the target graph comprising nodes at multiple levels, each level comprising at least one node, an edge between two nodes at different levels being used to represent an association relationship between the two nodes, and the node being used to describe a demand for generating promotional information;

[0010] Traversing the nodes of each level contained in the target graph, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, and determining each demand path containing nodes of different levels according to the edges between the nodes of each level;

[0011] Determine each promotional information generation task according to the nodes respectively included in each demand path;

[0012] The promotional information generation tasks are assigned to the second users, so that the second users determine the promotional information according to the assigned promotional information generation tasks.

[0013] Optionally, traversing the nodes of each level contained in the target graph, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, to determine the demand path containing nodes of different levels, specifically includes:

[0014] For each node of the first level in the target graph, take the node as the current node, and determine the associated node of the current node in the nodes of the next level of the current node according to the edges connected to the current node;

[0015] The associated node is re-used as the current node, and the associated node of the current node is re-determined in the nodes of the next level of the current node, until the re-determined associated node is the node of the last level in the target graph;

[0016] According to the node and the determined several associated nodes, a demand path starting from the node is obtained.

[0017] Optionally, determining each promotional information generation task according to the nodes respectively included in each demand path specifically includes:

[0018] For each demand path, the number of tasks corresponding to each node included in the demand path is obtained; the number of tasks is used to indicate the number of publicity information generated according to the publicity information generation demand corresponding to the node;

[0019] Determine the total number of tasks corresponding to the demand path according to the number of tasks corresponding to each node included in the demand path;

[0020] According to the total number of tasks corresponding to the demand path, each promotional information generation task corresponding to the demand path is determined.

[0021] Optionally, the target graph includes nodes corresponding to a plurality of second users;

[0022] Allocating the promotional information generation tasks to the second users specifically includes:

[0023] For each publicity information generation task, determine each second user corresponding to the publicity information generation task according to the second users corresponding to each node included in the demand path corresponding to the publicity information generation task;

[0024] A selection instruction is received, and according to the selection operation input by the first user contained in the selection instruction, target users corresponding to the promotional information generation task are determined from among the second users, and the promotional information generation task is respectively assigned to the target users.

[0025] Optionally, the target graph includes nodes corresponding to a plurality of second users;

[0026] Allocating the promotional information generation tasks to the second users specifically includes:

[0027] For each publicity information generation task, determine each second user corresponding to the publicity information generation task according to the second users corresponding to each node included in the demand path corresponding to the publicity information generation task;

[0028] Acquire attribute information corresponding to each determined second user, wherein the attribute information at least includes to-be-completed tasks and designated task types of the second users;

[0029] According to the determined attribute information corresponding to each second user, a target user corresponding to the promotional information generation task is determined from each second user;

[0030] The promotional information generation task is assigned to the target user.

[0031] Optionally, the method further comprises:

[0032] receiving a cancellation instruction, and deleting the corresponding relationship between the promotional information generation task and the second user according to the cancellation operation input by the second user contained in the cancellation instruction;

[0033] Reallocate the promotional information generation task.

[0034] Optionally, the method further comprises:

[0035] receiving the promotional information input by the second user, updating the current state of the promotional information generation task corresponding to the received promotional information to a pending review state, and generating prompt information for prompting the first user to review the promotional information;

[0036] Displaying the prompt information to the first user;

[0037] Receive the review result of the promotional information input by the first user.

[0038] This specification provides a task management device, including:

[0039] A target graph acquisition module, used to acquire a target graph input by a first user, wherein the target graph includes nodes at multiple levels, each level includes at least one node, and an edge between two nodes at different levels is used to represent an association relationship between the two nodes, and the node is used to describe a demand for generating promotional information;

[0040] A demand path determination module is used to traverse the nodes of each level contained in the target graph, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, and determining each demand path containing nodes of different levels according to the edges between the nodes of each level;

[0041] A task determination module, used to determine each promotional information generation task according to the nodes respectively included in each demand path;

[0042] The allocation module is used to allocate each of the promotional information generation tasks to each of the second users, so that each of the second users determines the promotional information according to the allocated promotional information generation tasks.

[0043] This specification provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the above-mentioned task management method is implemented.

[0044] This specification provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the above-mentioned task management method is implemented when the processor executes the program.

[0045] At least one of the above technical solutions adopted in this specification can achieve the following beneficial effects:

[0046] In the task management method provided in this specification, a target graph input by a first user is received, nodes of each level contained in the target graph are traversed, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, each demand path containing nodes of different levels is determined, and each publicity information generation task is determined according to the nodes respectively contained in each demand path, and each publicity information generation task is assigned to each second user, so that each second user determines the publicity information according to the assigned publicity information generation task. It can be seen that the demand details of the publicity information can be completely covered by each node with a hierarchical relationship in the target graph, thereby enhancing the accuracy of the publicity information. Moreover, in the target graph, the association relationship between nodes of different levels can be clarified through the edges between each node, thereby improving the generation efficiency of the publicity information. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] The drawings described herein are used to provide a further understanding of this specification and constitute a part of this specification. The exemplary embodiments and descriptions of this specification are used to explain this specification and do not constitute an improper limitation on this specification.

[0048] In the figure:

[0049] Figure 1 is a schematic diagram of a task management system in this specification;

[0050] Figure 2 is a schematic diagram of a task management system in this specification;

[0051] Figure 3 A flowchart of a task management method in this manual;

[0052] Figure 4 A schematic diagram of a target graph in this specification;

[0053] Figure 5 A flowchart of a task management method in this manual;

[0054] Figure 6 A schematic diagram of a task management device provided in this specification;

[0055] Figure 7 The corresponding Figure 3 Schematic diagram of electronic equipment. DETAILED DESCRIPTION

[0056] In order to make the purpose, technical solutions and advantages of this specification more clear, the technical solutions of this specification will be clearly and completely described below in combination with the specific embodiments of this specification and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of this specification, not all of them. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this specification.

[0057] In addition, it should be noted that all actions of acquiring signals, information or data in this manual are performed in compliance with the relevant local data protection laws and policies and with the authorization given by the owner of the corresponding device.

[0058] It should be noted that, in the absence of conflict, the features in the following embodiments and implementations may be combined with each other.

[0059] As mentioned above, for recording and managing the design requirements of publicity information and the corresponding publicity information generation tasks, if the text description method is used, the details of the requirements may be omitted because the pure text description cannot fully cover all the design requirements details. In addition, different designers may have different understandings of the same text description. If there is not enough context support, the publicity information design requirements described in the text may lead to ambiguity in interpretation, which in turn affects the accuracy of the publicity information generated by the designer to convey the purpose of the merchant's publicity. If the list method is used, although the list can list the key points, it lacks logical connection and it is not easy to see the relationship between the various requirements. This may lead to improper handling of problems such as dependencies between requirements. In addition, with the expansion of the scale of publicity information generation tasks, the continuous modification and iteration of design requirements, and other problems, traditional text documents and lists will be scattered among different managers and designers, making it difficult to uniformly manage and quickly access them, and it is easy to have information asymmetry and communication barriers, further reducing the execution efficiency of publicity information generation.

[0060] Based on this, this specification provides a task management method, which determines the promotional information generation task through a target graph. Since the target graph contains nodes with hierarchical relationships, there are also edges between nodes at different levels for representing the association relationship, which improves the coverage of the needs and clarifies the relationship between the demand items, thereby improving the accuracy and generation efficiency of the promotional information.

[0061] The technical solutions provided by the embodiments of this specification are described in detail below in conjunction with the accompanying drawings.

[0062] like Figure 1 The figure shows an optional architecture diagram of a task management system, wherein the task management system includes a server for executing the task management method provided in this specification, wherein the first user can use the first client to interact with the server to receive or send messages, and the second user can use the second client to interact with the server to receive or send messages. The first client and the second client can include various electronic devices such as smart phones, tablet computers, laptop computers, and desktop computers. The server can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides cloud computing services. The communication links used by the first client and the second client to interact with the server can be wired communication links or wireless communication links, and the wireless communication links include but are not limited to: Bluetooth, Wi-Fi, near field communication, and cellular mobile communication networks. Figure 2 The following is another optional architecture diagram of the task management system, in which the first user can directly input operations or information through the server. Figure 1 still Figure 2For ease of description, the following architecture is Figure 1 Taking the task management system shown in the figure as an example, the specific technical solution is explained.

[0063] Figure 3 A flowchart of a task management method provided in this specification.

[0064] S100: Obtain a target graph input by a first user. The target graph includes nodes at multiple levels, each level includes at least one node, and the edge between two nodes at different levels is used to represent the association relationship between the two nodes, and the node is used to describe the need for generating promotional information.

[0065] A task management method provided in an embodiment of the present specification can be executed by an electronic device such as a server for task management. Figure 1 or Figure 2 A server in the task management system shown.

[0066] In this specification, the first user may be the person responsible for configuring the promotional information design requirements, and the second user may be the person who performs the promotional information generation task to obtain the promotional information. Generally, the number of second users is multiple, and the number of first users can be one or more, and this specification does not limit this.

[0067] The first user can send a target graph to the server through the first client. The target graph is a graph structure including nodes of multiple levels. In the target graph, each level includes at least one node. Nodes of different levels can be connected by edges. The edge can represent the association relationship between the two connected nodes. The association relationship can be a subordinate relationship, a descriptive relationship, etc.

[0068] The target graph contains nodes that can be used to describe the design requirements of publicity information, and the publicity information design requirements corresponding to different nodes can be the same or different. Different nodes of the target graph can correspond to the same or different node types, and a node type corresponds to a level in the target graph. The node type corresponding to the node in the target graph (or the level in the target graph) includes at least publicity information identification, material type, publicity direction, description information, and can also include publicity features, publicity elements, etc. This specification does not limit the number of levels and the number of nodes contained in a target graph. In addition, the node information corresponding to each level in the target graph can be flexibly determined according to the actual application scenario. Optionally, in the target graph, the publicity information identification node can be used as a node of the first level, and other types of nodes can be used as nodes of other levels that are directly or indirectly connected to the publicity information identification node.

[0069] Among them, each node type (level) may correspond to one or more sub-type nodes corresponding to the node type. Specifically, the material type can be used to describe the source of the images, texts, audio and video materials contained in the promotional information, which may include original types, secondary creation types, material library types, etc. The promotional direction can be used to describe the core selling points that the promotional information hopes to convey. For example, when the promotional information is a video advertisement for promoting a game, the promotional direction may include leisure, cards, welfare, plot, strategy, competition, etc. The description information is used to clearly describe and define the design requirements of the promotional information.

[0070] The target graph may be configured and generated by the first user through the first client, or the first user may configure and generate a configuration file corresponding to the target graph on other terminals and then send the configuration file to the server through the first client.

[0071] Taking the example of the first user configuring the target graph through the first client, the first user can first determine the node types corresponding to each level contained in the target graph according to the design goal of the promotional information, and then input the nodes of each level one by one according to the determined node types corresponding to each level, and build the association relationship between the nodes of each level through the edges. Figure 4 The diagram shows an optional target graph. The first level is the promotion information identification, and the corresponding node is "001". The second level is the material type, and the corresponding nodes are "Original" and "Secondary Creation" connected to the node "001". The third level is the promotion direction, and the corresponding nodes are "Cards" and "Strategy" connected to the node "Original", and "Plot" connected to the node "Secondary Creation". The fourth level is the description information, and the corresponding nodes are "Description Text A" connected to "Cards", "Description Text B" connected to "Strategy", and "Description Text C" connected to "Plot".

[0072] In addition, the present specification does not limit the form of the promotional information, which may be one of images, text, audio, and video, or a combination of multiple. The promotional information in the present specification may be any promotional information that merchants in any existing field need to place to attract users to purchase goods or services provided by the merchants, such as beverage advertisements, educational service promotions, etc.

[0073] S102: Traverse the nodes of each level contained in the target graph, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, and determine each demand path containing nodes of different levels according to the edges between the nodes of each level.

[0074] Furthermore, the server can determine the promotional information generation task by combining nodes according to the nodes of each level contained in the target graph and the relationship between the nodes of each level. The node combination is actually to combine multiple nodes belonging to different levels connected by edges, and regard the nodes included in the same group as a design requirement for promotional information.

[0075] Specifically, the edges between the nodes in the target graph can be directed edges. Based on the direction represented by the directed edges or the marks of the first user in the target graph, the arrangement order of the levels in the target graph can be determined. Thus, the node of the first level is used as the starting node, and the next node of the starting node is determined based on the edge connected to the starting node. Then, the next node is determined based on the edge connected to the next node, and the cycle is repeated until the last level is determined. In this way, a demand path can be obtained, which starts with the node of the first level and ends at the node of the last level, contains several nodes of different levels in the middle, and each node is connected by edges. The nodes of each level contained in the demand path are the same group of nodes used to represent the design requirements of a specific promotional information.

[0076] Still Figure 4 For example, according to the directed edges between nodes at each level, it is determined that the first level is the promotional information logo, and the last level is the descriptive information. Then, taking node "001" as the starting point, according to the edges connected to the node, it can be determined that the next node is the node "original" belonging to the material type and the node "secondary creation". After that, continue to execute according to the above plan, and you can determine three demand paths: 001→original→card→description text A; 001→original→strategy→description text B; 001→secondary creation→plot→description text C.

[0077] In addition, after traversing the nodes of each level contained in the target graph to obtain each demand path, there are multiple demand paths containing exactly the same nodes. These multiple demand paths containing exactly the same nodes can be merged. Therefore, when generating a promotional information generation task, the nodes contained in the demand paths corresponding to different promotional information generation tasks are not exactly the same, so that the promotional information design requirements corresponding to different promotional information generation tasks are not exactly the same.

[0078] S104: Determine each promotional information generation task according to the nodes respectively included in each demand path.

[0079] Specifically, for each demand path, the demand path includes multiple nodes, and different nodes correspond to different levels in the target graph. Based on this, usually the number of nodes included in a demand path will not exceed the number of levels included in the target graph.

[0080] In this specification, a demand path may correspond to a design requirement for a promotional information, that is, a promotional information generation task is determined based on each node included in a demand path. In subsequent steps, the promotional information generation task is handed over to the second user to execute, and a promotional information may be obtained, such as a video advertisement for recommending a beverage product.

[0081] However, in actual applications, for the same design requirements, multiple strategies and methods can be used to deal with the design requirements, thereby generating multiple versions of promotional information, and merchants can choose from these multiple versions of promotional information to deliver more effective promotional information. Therefore, in this specification, a demand path can also correspond to the design requirements of multiple promotional information, that is, these multiple promotional information share the same design requirements when they are generated, so that, in fact, multiple promotional information generation tasks are determined based on the nodes included in a demand path. In subsequent steps, the promotional information generation task is handed over to the second user to execute, and multiple promotional information can be obtained. For example, for the same design requirements, multiple video advertisements for recommending beverage products with different color schemes and music are generated.

[0082] Therefore, in this specification, in order to improve the efficiency of generating promotional information, the number of tasks can be configured for each node in the target graph, so that each node included in the demand path can correspond to one or more tasks. Therefore, optionally, this step can also be implemented by the following implementation:

[0083] Step 1: For each demand path, obtain the number of tasks corresponding to each node included in the demand path. The number of tasks is used to indicate the number of publicity information generated according to the publicity information generation demand corresponding to the node.

[0084] Specifically, the number of tasks corresponding to a node may be pre-configured in the target graph by the first user. The number of tasks corresponding to a node may be one or more, and the number of tasks corresponding to different nodes may be the same or different. The number of tasks may indicate the need for generating publicity information based on the corresponding node and the number of publicity information generated. For example, Figure 4 If the number of tasks corresponding to the middle node "Card" is 3, three different promotional messages can be generated, but all must meet the promotional information generation requirements corresponding to the "Card".

[0085] Step 2: Determine the total number of tasks corresponding to the demand path based on the number of tasks corresponding to each node included in the demand path.

[0086] After that, the number of tasks corresponding to all nodes included in the demand path is accumulated to obtain the total number of tasks corresponding to the demand path. For example, for the demand path 001→original→card→description text A, if the number of tasks corresponding to the four nodes on the demand path is 1, 2, 3, and 1 respectively, then the total number of tasks corresponding to the demand path can be 7.

[0087] Step 3: Determine the promotional information generation tasks corresponding to the demand path based on the total number of tasks corresponding to the demand path.

[0088] S106: Allocate each of the promotional information generation tasks to each of the second users, so that each of the second users determines the promotional information according to the allocated promotional information generation task.

[0089] Furthermore, after determining each promotional information generation task according to each node in the target graph, each promotional information generation task can be assigned to each second user. In this specification, the second user may be a person who performs the promotional information generation task and creates and completes the promotional information design work.

[0090] The allocation scheme for allocating each promotional information generation task to each second user can be manual allocation by the first user, automatic allocation, or active claim by the second user. The actual allocation scheme can be determined based on the actual application scenario, and this manual does not limit this.

[0091] After each promotional information generation task is assigned, a correspondence between each promotional information generation task and each second user is established and stored. Both the first user and the second user can query the correspondence between each promotional information generation task and each second user to track the progress of the task, thereby improving the efficiency of generating promotional information.

[0092] In the task management method provided in the present specification, a target graph input by a first user is received, nodes of each level contained in the target graph are traversed, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, each demand path containing nodes of different levels is determined, each publicity information generation task is determined according to the nodes respectively contained in each demand path, and each publicity information generation task is assigned to each second user, so that each second user determines the publicity information according to the assigned publicity information generation task.

[0093] It can be seen that by including nodes with hierarchical relationships in the target graph, the required details of the promotional information can be fully covered, thereby enhancing the accuracy of the promotional information. In addition, in the target graph, the relationship between nodes at different levels can be clarified through the edges between nodes, thereby improving the efficiency of generating promotional information.

[0094] In one or more embodiments of this specification, Figure 3 The step S102 shown in FIG. 102 determines each demand path including nodes at different levels, which can be implemented by the following implementation methods: Figure 5 As shown:

[0095] S200: For each node of the first level in the target graph, take the node as the current node, and determine the associated nodes of the current node in the nodes of the next level of the current node according to the edges connected to the current node.

[0096] Similar to the aforementioned step S102, the order of the levels in the target graph may be determined based on the directions represented by the directed edges between the nodes or the marks of the first user in the target graph, thereby determining the first level and the last level. Afterwards, for each node belonging to the first level, based on the edges connected to the node, the nodes of the next level that are directly associated with the node are determined as associated nodes.

[0097] S202: Taking the associated node as the current node, and re-determining the associated node of the current node in the nodes of the next layer of the current node.

[0098] Afterwards, the associated node is used as the current node and step S200 is re-executed to determine the next associated node in the nodes of the second level.

[0099] S204: Determine whether the newly determined associated node is a node at the last level in the target graph. If so, execute step S206, otherwise return to execute step S202.

[0100] S206: Obtain a demand path starting from the node according to the node and the determined plurality of associated nodes.

[0101] In practice, since the target graph may contain nodes of multiple levels, it takes multiple cycles to traverse from the first level to the last level. Therefore, after re-determining the associated node, it is possible to determine whether the re-determined associated node is a node of the last level in the target graph. If so, it means that the nodes of all levels included in the target graph have been traversed. At this time, the required path can be directly output based on the node of the first level as the starting point and the several associated nodes determined by multiple cycles. If the re-determined associated node is not a node of the last level in the target graph, step S202 needs to be executed repeatedly.

[0102] In an optional embodiment of this specification, Figure 3 Step S106 shown can be implemented by the following implementations:

[0103] Step 1: for each publicity information generation task, determine each second user corresponding to the publicity information generation task according to the second users corresponding to each node included in the demand path corresponding to the publicity information generation task.

[0104] Specifically, each node included in the target graph corresponds to one or more second users to be selected, and the number of second users and specific users corresponding to each node may be the same or different, which is not limited in this specification. The number of second users corresponding to each node in the target graph may be configured by the first user, may be automatically configured, or may be actively claimed by the second user, which is not limited in this specification.

[0105] Step 2: Receive a selection instruction, determine the target users corresponding to the promotional information generation task from among the second users according to the selection operation input by the first user indicated by the selection instruction, and assign the promotional information generation task to the target users respectively.

[0106] After the server determines the second users corresponding to each publicity information generation task in the first step, the first user can view the second users corresponding to each publicity information generation task determined by the server through the first client. The first client can display the second users corresponding to each publicity information generation task in the display interface, and display the selection control for each publicity information generation task. Thus, the first client can receive the selection operation input by the first user through the selection control corresponding to each publicity information generation task, and the first client can generate a selection instruction based on the selection operation and the identifier of the publicity information generation task, and send the selection instruction to the server. The server receives the selection instruction, and can parse the selection instruction to obtain the identifier of the publicity information generation task and the corresponding selection operation, thereby determining the target user corresponding to the publicity information generation task.

[0107] In an optional embodiment of this specification, Figure 3 Step S106 shown can be implemented by the following implementations:

[0108] Step 1: for each publicity information generation task, determine each second user corresponding to the publicity information generation task according to the second users corresponding to each node included in the demand path corresponding to the publicity information generation task.

[0109] This step is similar to the first step above and will not be repeated here.

[0110] Step 2: Acquire attribute information corresponding to each determined second user, wherein the attribute information at least includes the to-be-completed tasks and the designated task type of the second user.

[0111] Specifically, in this specification, when the second user who performs the task is automatically assigned to each publicity information generation task through an algorithm, the attribute information of the second user can be obtained as the basis for the assignment. Specifically, the attribute information of the second user may include the task to be completed by the second user, which is actually the publicity information generation task assigned to the second user and has not been completed. The attribute information may also include the specified task type of the second user, and the specified task type is used to indicate the type of publicity information generation task that the second user is good at handling, that is, when the second user performs the publicity information generation task of the specified task type, the quality and efficiency of the publicity information obtained are higher. The task to be completed by the second user can be recorded and saved when assigning tasks, and the current status of each publicity information generation task assigned to each second user is recorded, so that the task assigned to the second user and the current status is to be completed according to the second user query, as the task to be completed by the second user. The specified task type of the second user can be pre-configured by the second user.

[0112] Step 3: According to the determined attribute information corresponding to each second user, determine the target user corresponding to the promotional information generation task from among the second users.

[0113] Specifically, a pre-optimized allocation algorithm may be used to allocate the promotional information generation task to a second user who has fewer tasks to be completed and whose specified task type is similar to the type of the promotional information generation task. Specifically, the allocation algorithm may predict the matching degree between each second user and the promotional information generation task based on the attribute information of each second user, and select the second user with the highest matching degree as the target user corresponding to the promotional information generation task based on the matching degree between the promotional information generation task and each second user. The following is an optional matching degree calculation method:

[0114] S ij =α·Match(E i ,R j )+(1-α)·Load(L i )

[0115] Among them, E i The second user P i The specified task type, R j Represents the promotional information generation task T j The task type, therefore, Match(E i ,R j ) is used to represent the second user P i The matching degree between the specified task type and the task type of the propaganda information generation task Tj, Load(L i ) represents the second user Pi The more tasks to be processed, the greater the workload. α is the pre-optimized weight used to match the relationship between task type matching and workload.

[0116] In addition, if it is determined based on the allocation algorithm that multiple second users have the same matching degree with the same promotional information generation task, other types of attribute information of the second users may be introduced for decision making, such as historical tasks performed by the second users.

[0117] Step 4: Assign the promotional information generation task to the target user.

[0118] In this specification, the method of automatically allocating promotional information generation tasks can greatly reduce the time and effort of manual allocation, and at the same time, tasks can be allocated more fairly and efficiently through algorithm optimization.

[0119] Furthermore, in allocating each promotional information generation task to each second user based on step S106, a correspondence between each promotional information generation task and each second user is actually established to improve the management efficiency of the promotional information generation task. In practice, the second user can choose to cancel the promotional information generation task assigned to himself, and at this time, the canceled promotional information generation task needs to be reallocated.

[0120] Specifically, a cancellation instruction is received, and according to the cancellation operation input by the second user included in the cancellation instruction, the corresponding relationship between the promotional information generation task and the second user is deleted. Afterwards, the promotional information generation task is reallocated, and the reallocation scheme may be similar to the aforementioned step S106, which will not be described in detail here.

[0121] In addition, it should be noted that in order to avoid erroneous operations of canceling the promotional information generation task, user permissions can be assigned to each second user separately, that is, the second user can only cancel the promotional information generation task assigned to him, and cannot cancel the promotional information generation task assigned to other second users.

[0122] In the task management method provided in this manual, in addition to Figure 1 The illustrated implementation method can plan and allocate the promotional information generation tasks, monitor the execution and review of the promotional information generation tasks, centralize the information and status related to the promotional information generation tasks, and the first user and each second user can quickly access all information related to the promotional information generation tasks, thereby improving the efficiency of information sharing, strengthening communication and collaboration between teams, and thus improving the execution efficiency of the promotional information generation tasks.

[0123] The review of the promotional information generation task can be achieved through the following schemes:

[0124] First, the promotional information input by the second user is received, the current state of the promotional information generation task corresponding to the received promotional information is updated to a pending review state, and prompt information is generated to prompt the first user to review the promotional information.

[0125] Secondly, the prompt information is displayed to the first user.

[0126] Afterwards, the review result of the promotional information input by the first user is received.

[0127] Specifically, the review result of the promotional information may be one of a pass and a fail. When the review result of the promotional information is a pass, the promotional information may be sent to the delivery platform to deliver the promotional information. When the review result of the promotional information is a fail, the current state of the promotional information generation task corresponding to the promotional information may be updated to a fail state, and prompt information for prompting the second user to re-enter the promotional information is generated and displayed to the second user, so as to prompt the second user to re-execute the promotional information generation and re-upload the promotional information.

[0128] The monitoring of the completion time of the promotional information generation task can be achieved through the following scheme:

[0129] First, for each publicity information generation task, the estimated completion time of the publicity information generation task is determined according to the estimated completion time corresponding to each node included in the demand path corresponding to the publicity information generation task.

[0130] Specifically, each node included in the target graph may correspond to an estimated completion time, and the estimated completion time corresponding to each node may be configured by the first user in the target graph. The estimated completion time may be used to characterize the completion deadline corresponding to the promotional information generation requirement corresponding to the node. By configuring the estimated completion time, the generation process of the promotional information may be monitored to improve the generation efficiency of the promotional information. The estimated completion time may be an estimated completion time, such as an estimated completion time of three days, or a deadline, such as completion on X month Y day, which is not limited in this specification.

[0131] As mentioned above, the promotional information generation task corresponds to a demand path, and the demand path includes multiple nodes in the target graph. Based on the estimated completion time corresponding to each node, the estimated completion time of the promotional information generation task can be determined by a preset statistical method. For example, the estimated completion time corresponding to each node included in the demand path corresponding to the promotional information generation task is three days, two days, and three days, respectively. Then, by a preset cumulative statistical method, it can be determined that the estimated completion time of the promotional information generation task is eight days.

[0132] Afterwards, when the allocated time of the promotional information generation task assigned to the second user exceeds the expected completion time of the promotional information generation task, prompt information is generated to prompt the second user to input promotional information, and the prompt information is sent to the second client corresponding to the second user, so that the second client displays the prompt information to prompt the second user to input promotional information.

[0133] The above is a task management method provided by one or more embodiments of this specification. Based on the same idea, this specification also provides a corresponding task management device, such as Figure 6 shown.

[0134] Figure 6 A schematic diagram of a task management device provided in this specification specifically includes:

[0135] The target graph acquisition module 300 is used to acquire the target graph input by the first user, wherein the target graph includes nodes at multiple levels, each level includes at least one node, and the edge between two nodes at different levels is used to represent the association relationship between the two nodes, and the node is used to describe the need for generating promotional information;

[0136] A demand path determination module 302 is used to traverse the nodes of each level contained in the target graph, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, and determining each demand path containing nodes of different levels according to the edges between the nodes of each level;

[0137] The task determination module 304 is used to determine each promotional information generation task according to the nodes respectively included in each demand path;

[0138] The allocation module 306 is used to allocate the promotional information generation tasks to the second users, so that the second users determine the promotional information according to the allocated promotional information generation tasks.

[0139] Optionally, the demand path determination module 302 is specifically used to, for each node of the first level in the target graph, take the node as the current node, and determine the associated nodes of the current node in the nodes of the next level of the current node based on the edges connected to the current node; take the associated node again as the current node, and redetermine the associated nodes of the current node in the nodes of the next level of the current node, until the re-determined associated node is a node of the last level in the target graph; and obtain the demand path starting from the node based on the node and the determined several associated nodes.

[0140] Optionally, the task determination module 304 is specifically used to, for each demand path, obtain the number of tasks corresponding to each node included in the demand path; the number of tasks is used to indicate the number of publicity information generated according to the publicity information generation demand corresponding to the node; according to the number of tasks corresponding to each node included in the demand path, determine the total number of tasks corresponding to the demand path; according to the total number of tasks corresponding to the demand path, determine each publicity information generation task corresponding to the demand path.

[0141] Optionally, the target graph includes nodes corresponding to a plurality of second users;

[0142] Optionally, the allocation module 306 is specifically used to, for each publicity information generation task, determine the second users corresponding to the publicity information generation task according to the second users corresponding to each node included in the demand path corresponding to the publicity information generation task; receive a selection instruction, and determine the target users corresponding to the publicity information generation task from the second users according to the selection operation input by the first user included in the selection instruction, and assign the publicity information generation task to the target users respectively.

[0143] Optionally, the target graph includes nodes corresponding to a plurality of second users;

[0144] Optionally, the allocation module 306 is specifically used to, for each publicity information generation task, determine the second users corresponding to the publicity information generation task according to the second users corresponding to each node included in the demand path corresponding to the publicity information generation task; obtain attribute information corresponding to each determined second user, the attribute information at least including the to-be-completed tasks and the specified task type of the second user; determine the target user corresponding to the publicity information generation task from each second user according to the attribute information corresponding to each determined second user; and assign the publicity information generation task to the target user.

[0145] Optionally, the device further comprises:

[0146] The reallocation module 308 is specifically configured to receive a cancellation instruction, delete the corresponding relationship between the promotional information generation task and the second user according to the cancellation operation input by the second user contained in the cancellation instruction, and reallocate the promotional information generation task.

[0147] Optionally, the device further comprises:

[0148] The review module 310 is specifically used to receive the promotional information input by the second user, update the current status of the promotional information generation task corresponding to the received promotional information to a pending review status, and generate prompt information for prompting the first user to review the promotional information; display the prompt information to the first user; and receive the review result of the promotional information input by the first user.

[0149] This specification also provides a computer-readable storage medium, which stores a computer program, which can be used to execute the above Figure 3 The task management method shown.

[0150] This manual also provides Figure 7 The schematic structure diagram of the electronic device shown in FIG. Figure 7 As mentioned above, at the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, and may also include other hardware required for the business. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it to achieve the above Figure 3 Of course, in addition to the software implementation, this specification does not exclude other implementations, such as logic devices or a combination of software and hardware, etc., that is, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0151] In the 1990s, improvements to a technology could be clearly distinguished as hardware improvements (for example, improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the method flow). However, with the development of technology, many improvements to the method flow today can be regarded as direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. Therefore, it cannot be said that an improvement in a method flow cannot be implemented using a hardware entity module. For example, a programmable logic device (PLD) (such as a field programmable gate array (FPGA)) is such an integrated circuit whose logical function is determined by the user's programming of the device. Designers can "integrate" a digital system on a PLD by programming it themselves, without having to ask a chip manufacturer to design and produce a dedicated integrated circuit chip. Moreover, nowadays, instead of manually making integrated circuit chips, this kind of programming is mostly implemented by "logic compiler" software, which is similar to the software compiler used when developing and writing programs, and the original code before compilation must also be written in a specific programming language, which is called hardware description language (HDL). There is not only one HDL, but many kinds, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc. The most commonly used ones are VHDL (Very-High-Speed ​​Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should also know that it is only necessary to program the method flow slightly in the above-mentioned hardware description languages ​​and program it into the integrated circuit, and then it is easy to obtain the hardware circuit that implements the logic method flow.

[0152] The controller can be implemented in any appropriate manner, for example, the controller can take the form of a microprocessor or processor and a computer-readable medium storing a computer-readable program code (such as software or firmware) that can be executed by the (micro)processor, a logic gate, a switch, an application-specific integrated circuit (ASIC), a programmable logic controller, and an embedded microcontroller. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320. The memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art also know that in addition to implementing the controller in a purely computer-readable program code manner, the controller can be implemented in the form of a logic gate, a switch, an application-specific integrated circuit, a programmable logic controller, and an embedded microcontroller by logically programming the method steps. Therefore, this controller can be considered as a hardware component, and the devices included therein for implementing various functions can also be regarded as structures within the hardware component. Or even, the devices for implementing various functions can be regarded as both software modules for implementing the method and structures within the hardware component.

[0153] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0154] For the convenience of description, the above device is described in various units according to their functions. Of course, when implementing this specification, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0155] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems, or computer program products. Therefore, this specification may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0156] This specification is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of this specification. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0157] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0158] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0159] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0160] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0161] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0162] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0163] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems or computer program products. Therefore, this specification may take the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware. Moreover, this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0164] This specification may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. This specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

[0165] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0166] The above description is only an embodiment of the present specification and is not intended to limit the present specification. For those skilled in the art, the present specification may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification shall be included in the scope of the claims of the present specification.

Claims

1. A task management method, characterized in that: include: Obtaining a target graph input by a first user, the target graph comprising nodes at multiple levels, each level comprising at least one node, an edge between two nodes at different levels being used to represent an association relationship between the two nodes, and the node being used to describe a demand for generating promotional information; Traversing the nodes of each level contained in the target graph, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, and determining each demand path containing nodes of different levels according to the edges between the nodes of each level; Determine each promotional information generation task according to the nodes respectively included in each demand path; The promotional information generation tasks are assigned to the second users, so that the second users determine the promotional information according to the assigned promotional information generation tasks.

2. The method according to claim 1, characterized in that Traversing the nodes of each level contained in the target graph, starting from the node of the first level in the target graph and ending at the node of the last level in the target graph, to determine the demand path containing nodes of different levels, specifically includes: For each node of the first level in the target graph, take the node as the current node, and determine the associated node of the current node in the nodes of the next level of the current node according to the edges connected to the current node; The associated node is re-used as the current node, and the associated node of the current node is re-determined in the nodes of the next level of the current node, until the re-determined associated node is the node of the last level in the target graph; According to the node and the determined several associated nodes, a demand path starting from the node is obtained.

3. The method according to claim 1, characterized in that Determine each promotional information generation task according to the nodes respectively included in each demand path, specifically including: For each demand path, the number of tasks corresponding to each node included in the demand path is obtained; the number of tasks is used to indicate the number of publicity information generated according to the publicity information generation demand corresponding to the node; Determine the total number of tasks corresponding to the demand path according to the number of tasks corresponding to each node included in the demand path; According to the total number of tasks corresponding to the demand path, each promotional information generation task corresponding to the demand path is determined.

4. The method according to claim 1, characterized in that The target graph includes nodes corresponding to a plurality of second users; Allocating the promotional information generation tasks to the second users specifically includes: For each publicity information generation task, determine each second user corresponding to the publicity information generation task according to the second users corresponding to each node included in the demand path corresponding to the publicity information generation task; A selection instruction is received, and according to the selection operation input by the first user contained in the selection instruction, target users corresponding to the promotional information generation task are determined from among the second users, and the promotional information generation task is respectively assigned to the target users.

5. The method according to claim 1, characterized in that The target graph includes nodes corresponding to a plurality of second users; Allocating the promotional information generation tasks to the second users specifically includes: For each publicity information generation task, determine each second user corresponding to the publicity information generation task according to the second users corresponding to each node included in the demand path corresponding to the publicity information generation task; Acquire attribute information corresponding to each determined second user, wherein the attribute information at least includes to-be-completed tasks and designated task types of the second users; According to the determined attribute information corresponding to each second user, a target user corresponding to the promotional information generation task is determined from each second user; The promotional information generation task is assigned to the target user.

6. The method according to claim 1, characterized in that The method further comprises: receiving a cancellation instruction, and deleting the corresponding relationship between the promotional information generation task and the second user according to the cancellation operation input by the second user contained in the cancellation instruction; Reallocate the promotional information generation task.

7. The method according to claim 1, characterized in that The method further comprises: receiving the promotional information input by the second user, updating the current state of the promotional information generation task corresponding to the received promotional information to a pending review state, and generating prompt information for prompting the first user to review the promotional information; Displaying the prompt information to the first user; Receive the review result of the promotional information input by the first user.

8. A task management device, characterized in that: include: A target graph acquisition module, used to acquire a target graph input by a first user, wherein the target graph includes nodes at multiple levels, each level includes at least one node, and an edge between two nodes at different levels is used to represent an association relationship between the two nodes, and the node is used to describe a demand for generating promotional information; A demand path determination module is used to traverse the nodes of each level contained in the target graph, starting from the nodes of the first level in the target graph and ending at the nodes of the last level in the target graph, and determining each demand path containing nodes of different levels according to the edges between the nodes of each level; A task determination module, used to determine each promotional information generation task according to the nodes respectively included in each demand path; The allocation module is used to allocate each of the promotional information generation tasks to each of the second users, so that each of the second users determines the promotional information according to the allocated promotional information generation tasks.

9. A computer-readable storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

10. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the method according to any one of claims 1 to 7 is implemented.

Images