CN117993789B

CN117993789B - Performance management method, device, equipment and storage medium based on task decomposition

Info

Publication number: CN117993789B
Application number: CN202410398008.1A
Authority: CN
Inventors: 庄晨光; 牛林杰; 张冰鑫; 彭春喜; 吴波; 熊剑; 林志远; 王中生; 刘玲
Original assignee: Linjiu Wisdom Guangdong Technology Co ltd
Current assignee: Linjiu Wisdom Guangdong Technology Co ltd
Priority date: 2024-04-03
Filing date: 2024-04-03
Publication date: 2024-06-04
Anticipated expiration: 2044-04-03
Also published as: CN117993789A

Abstract

The invention provides a performance management method, a device, equipment and a storage medium based on task decomposition, wherein the method comprises the following steps: acquiring a task tree created through a first-level account and issuing the task tree to a second-level account; configuring subtasks to form a task set through a second-level account, and setting a third-level account of the subtasks and first intensity information representing the influence degree of other subtasks of the same task set; after the task set is configured, the first-level account configures second-intensity information for the subtasks, wherein the second-intensity information characterizes the influence degree of the subtasks of different task sets; after determining the associated task of the subtask, distributing the associated task to a corresponding third-level account; and calculating performance scores based on the completion condition of each subtask, and correcting the scores by the associated tasks to obtain target task scores for performance management. Therefore, the influence of multi-task cooperation can be introduced when performance management is carried out, the dimension of the performance management is increased, and the flexibility and the comprehensiveness of the performance management can be improved.

Description

Performance management method, device, equipment and storage medium based on task decomposition

Technical Field

The invention relates to the technical field of property data processing, in particular to a performance management method, device, equipment and storage medium based on task decomposition.

Background

In the property management, a manager can allocate respective work tasks to staff, the staff performs work according to the instructions of the work tasks, and the manager performs performance management according to the task completion conditions of the staff in a certain period. Traditional performance management is based on manual transmission completion, and the managers orally report task completion to the managers, and understanding deviation or information misleakage caused by expressive power easily occurs, so that the accuracy of performance management is lower.

In order to solve the problem, related technologies propose to perform online performance management through application programs, allocate management accounts to management staff of each level, create tasks through the management accounts and then allocate the tasks to subordinate ordinary staff, and the ordinary staff perform feedback through the application programs after completing the tasks, so that performance scoring is finally achieved through automatic statistics of the application programs. However, due to the limitation of account rights, each management account can only configure tasks for the associated employee account, so that simple quantity statistics can only be carried out on task completion conditions when performance scoring is carried out, the dimension is single, and the flexibility of performance management is poor.

Disclosure of Invention

The present invention aims to solve at least one of the technical problems existing in the prior art. Therefore, the invention provides a performance management method, device, equipment and storage medium based on task decomposition, which can automatically distribute tasks based on the dynamic association of a multi-task set, realize multi-dimensional performance management and improve the flexibility and comprehensiveness of the performance management.

In a first aspect, an embodiment of the present invention provides a performance management method based on task decomposition, including:

Acquiring a task tree created through a first level account, wherein the task tree comprises a plurality of mutually independent branch structures, each branch structure is associated with a second level account, the second level account is a lower level account of the first level account, and the number of the second level accounts is a plurality of second level accounts;

Issuing the task tree to each second-level account, activating configuration permission of each second-level account for the corresponding branch structure, and obtaining a task set configured by each second-level account for the branch structure, wherein the task set comprises at least one subtask, each subtask is preconfigured with first intensity information and third-level accounts, the first intensity information is used for indicating the influence degree between the subtask and the rest of subtasks in the same task set, and the third-level accounts are lower-level accounts of the second-level accounts;

when all the branch structures of the task tree complete the configuration of the task set, acquiring second intensity information configured by the first class account for each subtask, wherein the second intensity information is used for indicating the influence degree between the subtask and each subtask of different task sets;

Determining associated tasks of the subtasks based on the first intensity information and the second intensity information, creating associated prompt information of the subtasks based on the associated tasks, and distributing the subtasks carrying the associated prompt information to the corresponding third-level accounts;

When a performance management and control instruction aiming at the task tree is acquired, collecting first completion information and second completion information of each subtask, wherein the first completion information is used for indicating the completion state of the subtask, and the second completion information is used for indicating the completion state of the associated task;

Determining a task self score of the subtask based on the first completion information, determining a correction score of the subtask based on the second completion information, and determining a target task score of the subtask based on the task self score and the correction score;

and determining a first performance score, a second performance score and a third performance score based on all of the target task scores, wherein the first performance score is associated with the first level account, the second performance score is associated with the second level account, and the third performance score is associated with the third level account.

According to some embodiments of the invention, the obtaining the second intensity information configured by the first level account for each subtask includes:

determining the task type of each subtask, wherein the task type comprises an independent task and a cooperative task;

When the task type of the subtask is the independent task, setting the corresponding first intensity information to zero without adding an intensity configuration item, wherein the intensity configuration item is used for inputting the corresponding second intensity information;

When the task type of the subtask is the collaborative task, applying the pre-configured first intensity information and adding the intensity configuration item;

and associating the second intensity information input through the intensity configuration item to the corresponding subtask.

According to some embodiments of the invention, the determining the associated task of each sub-task based on the first intensity information and the second intensity information includes:

constructing an association relation matrix based on the first intensity information and the second intensity information of all the subtasks, wherein the association relation matrix is that ，/>For the ith subtask to the jth subtask the first intensity information or the second intensity information, the ith row matrix element is the ith subtask the first intensity information and the second intensity information, the jth column matrix element is the jth subtask the first intensity information and the second intensity information, n is the number of subtasks, i and j are positive integers, and i epsilon [1, n ], j epsilon [1, n ];

Determining target similarity between each pair of subtasks based on the incidence relation matrix, wherein the target similarity between the ith subtask and the jth subtask ，，/>R is a positive integer,/>For the intensity similarity of the ith row matrix element and the jth row matrix element,/>Intensity similarity for the ith and jth column matrix elements;

the associated task for which a pair of the subtasks is determined to be each other is determined based on the target similarity.

According to some embodiments of the invention, after the collecting the first completion information and the second completion information of each of the subtasks, the method further comprises:

Determining task input information and task output information of each subtask, wherein the task input information is used for indicating input information acquired before the subtask is switched to a completion state, and the task output information is used for indicating output information triggered after the subtask is switched to the completion state;

Determining a satisfaction parameter between each pair of subtasks based on the task input information and the task output information of the subtasks, wherein the satisfaction parameter ，/>Inputting information for the task of the ith subtask,/>Outputting information for the task of the j-th subtask,/>() Is a preset satisfaction function, and/>Following/>Increasing progressively;

Determining an actual degree of association between each pair of subtasks based on the satisfaction parameter, wherein the actual degree of association ,/>

When the actual association degree of a pair of subtasks meets a preset association condition, maintaining the corresponding two subtasks as the associated tasks of each other, otherwise, releasing the association relation;

Wherein, the association condition is:

minT is a preset association threshold,/> For the first of said subtasks,/>For the last of the subtasks, k is a positive integer and k ε [1, n ].

According to some embodiments of the invention, the determining the task self score of the subtask based on the first completion information and the determining the corrected score of the subtask based on the second completion information includes:

acquiring a preset first reference score, a second reference score and a third reference score, wherein the second reference score is smaller than the first reference score, and the third reference score is smaller than the second reference score;

Determining a first completion proportion of the subtasks based on the first completion information, and determining a second completion proportion of the associated tasks based on the second completion information;

Determining the target task score based on the first completion scale and the first reference score when the subtask does not have the associated task;

When the number of the associated tasks is one, determining a task self score based on the first completion proportion and the second reference score, and determining a correction score based on the second completion proportion and the third reference score;

And when the number of the associated tasks is multiple, sorting based on the actual association degree of each associated task, determining a conversion ratio of each associated task according to the sorting, determining a conversion score of each associated task based on the second completion ratio, the conversion ratio and the third reference score, and summing all the conversion scores to obtain the correction score.

According to some embodiments of the invention, the determining the first, second, and third performance scores based on all of the target task scores includes:

determining a third performance score of the third-level account based on the target task scores of all the subtasks corresponding to the third-level account;

a second performance score for the second level account is determined based on third account scores for all of the third level accounts attributed to the second level account, and a first performance score for the first level account is determined based on all of the second performance scores.

According to some embodiments of the invention, after the subtasks carrying the associated prompt information are assigned to the corresponding third-level accounts, the method further includes:

Sending task signing matters to the third-level account, and timing based on preset signing time length;

When the signing information aiming at the task signing matters is not acquired before the timing is completed based on the signing time length, signing prompt information is sent to the third-level account, and timing is performed again based on the signing time length;

And when the sending times of the signing prompt information reach a preset prompting times threshold value, generating the signing information of the task signing matters.

In a second aspect, an embodiment of the present invention provides a performance management apparatus based on task decomposition, including at least one control processor and a memory communicatively coupled to the at least one control processor; the memory stores instructions executable by the at least one control processor to enable the at least one control processor to perform the task decomposition based performance management method as described in the first aspect above.

In a third aspect, an embodiment of the present invention provides an electronic device, including a performance management apparatus based on task decomposition as described in the second aspect.

In a fourth aspect, an embodiment of the present invention provides a computer readable storage medium storing computer executable instructions for performing the task decomposition based performance management method according to the first aspect.

The performance management method based on task decomposition according to the embodiment of the invention has at least the following beneficial effects: acquiring a task tree created through a first level account, wherein the task tree comprises a plurality of mutually independent branch structures, each branch structure is associated with a second level account, the second level account is a lower level account of the first level account, and the number of the second level accounts is a plurality of second level accounts; issuing the task tree to each second-level account, activating configuration permission of each second-level account for the corresponding branch structure, and obtaining a task set configured by each second-level account for the branch structure, wherein the task set comprises at least one subtask, each subtask is preconfigured with first intensity information and a third-level account, the first intensity information is used for indicating the influence degree between the subtask and the rest of subtasks in the same task set, and the third-level account is a lower-level account of the second-level account; when all the branch structures of the task tree complete the configuration of the task set, acquiring second intensity information configured by the first class account for each subtask, wherein the second intensity information is used for indicating the influence degree between the subtask and each subtask of different task sets; determining associated tasks of the subtasks based on the first intensity information and the second intensity information, creating associated prompt information of the subtasks based on the associated tasks, and distributing the subtasks carrying the associated prompt information to the corresponding third-level accounts; when a performance management and control instruction aiming at the task tree is acquired, collecting first completion information and second completion information of each subtask, wherein the first completion information is used for indicating the completion state of the subtask, and the second completion information is used for indicating the completion state of the associated task; determining a task self score of the subtask based on the first completion information, determining a correction score of the subtask based on the second completion information, and determining a target task score of the subtask based on the task self score and the correction score; and determining a first performance score, a second performance score and a third performance score based on all of the target task scores, wherein the first performance score is associated with the first level account, the second performance score is associated with the second level account, and the third performance score is associated with the third level account. According to the technical scheme provided by the embodiment of the invention, the construction of the task tree is completed by the cooperation of the multi-level accounts, the intensity information between different tasks is configured to represent the action intensity when the subtasks are set, and the score is corrected from the dimension of the associated task based on the intensity information when the performance score is automatically calculated, so that the flexibility and the comprehensiveness of performance management can be improved.

Drawings

Fig. 1 is a flow chart of a task decomposition-based performance management method provided by an embodiment of the present invention;

FIG. 2 is a schematic diagram of a task tree provided by another embodiment of the present invention;

Fig. 3 is a schematic diagram of performance management provided by another embodiment of the present invention;

Fig. 4 is a complete flow chart of a task decomposition-based performance management method provided by another embodiment of the present invention;

fig. 5 is a block diagram of a performance management apparatus based on task decomposition according to another embodiment of the present invention.

Detailed Description

Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative only and are not to be construed as limiting the invention.

In the description of the present invention, it should be understood that references to orientation descriptions such as upper, lower, front, rear, left, right, etc. are based on the orientation or positional relationship shown in the drawings, are merely for convenience of description of the present invention and to simplify the description, and do not indicate or imply that the apparatus or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus should not be construed as limiting the present invention.

In the description of the present invention, a number means one or more, a number means two or more, and greater than, less than, exceeding, etc. are understood to not include the present number, and above, below, within, etc. are understood to include the present number. The description of the first and second is for the purpose of distinguishing between technical features only and should not be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated or implicitly indicating the precedence of the technical features indicated.

In the description of the present invention, unless explicitly defined otherwise, terms such as arrangement, installation, connection, etc. should be construed broadly and the specific meaning of the terms in the present invention can be reasonably determined by a person skilled in the art in combination with the specific contents of the technical scheme.

The embodiment of the invention provides a performance management method, a device, equipment and a storage medium based on task decomposition, wherein the performance management method based on task decomposition comprises the following steps: acquiring a task tree created through a first level account, wherein the task tree comprises a plurality of mutually independent branch structures, each branch structure is associated with a second level account, the second level account is a lower level account of the first level account, and the number of the second level accounts is a plurality of second level accounts; issuing a task tree to each second-level account, activating configuration permission of each second-level account for a corresponding branch structure, and acquiring a task set configured by each second-level account for the branch structure, wherein the task set comprises at least one subtask, each subtask is preconfigured with first strength information and third-level accounts, the first strength information is used for indicating the influence degree between the subtask and the rest of subtasks in the same task set, and the third-level account is a lower-level account of the second-level account; when all branch structures of the task tree complete the configuration of the task set, acquiring second intensity information configured by the first-level account for each subtask, wherein the second intensity information is used for indicating the influence degree between the subtask and each subtask of different task sets; determining associated tasks of all subtasks based on the first intensity information and the second intensity information, creating associated prompt information of the subtasks based on the associated tasks, and distributing the subtasks carrying the associated prompt information to corresponding third-level accounts; when a performance management and control instruction aiming at a task tree is acquired, collecting first completion information and second completion information of each subtask, wherein the first completion information is used for indicating the completion state of the subtask, and the second completion information is used for indicating the completion state of the associated task; determining a task self score of the subtask based on the first completion information, determining a correction score of the subtask based on the second completion information, and determining a target task score of the subtask based on the task self score and the correction score; a first performance score, a second performance score, and a third performance score are determined based on all of the target task scores, wherein the first performance score is associated with the first hierarchical account, the second performance score is associated with the second hierarchical account, and the third performance score is associated with the third hierarchical account. According to the technical scheme provided by the embodiment of the invention, the construction of the task tree is completed by the cooperation of the multi-level accounts, the intensity information between different tasks is configured to represent the action intensity when the subtasks are set, and the score is corrected from the dimension of the associated task based on the intensity information when the performance score is automatically calculated, so that the flexibility and the comprehensiveness of performance management can be improved.

The technical scheme of the embodiment of the invention is further described below based on the attached drawings.

Referring to fig. 1, fig. 1 is a flowchart of a performance management method based on task decomposition according to an embodiment of the present invention, where the performance management method based on task decomposition includes, but is not limited to, the following steps:

S10, acquiring a task tree created through a first level account, wherein the task tree comprises a plurality of mutually independent branch structures, each branch structure is associated with a second level account, the second level account is a lower level account of the first level account, and the number of the second level accounts is a plurality of second level accounts;

S20, issuing a task tree to each second-level account, activating configuration permission of each second-level account for a corresponding branch structure, and acquiring a task set configured by each second-level account for the branch structure, wherein the task set comprises at least one subtask, each subtask is preconfigured with first strength information and third-level accounts, the first strength information is used for indicating the influence degree between the subtask and the rest of subtasks in the same task set, and the third-level account is a lower-level account of the second-level account;

S30, when all branch structures of the task tree complete the configuration of the task set, obtaining second intensity information configured by the first-level account for each subtask, wherein the second intensity information is used for indicating the influence degree between the subtask and each subtask of different task sets;

S40, determining associated tasks of all subtasks based on the first intensity information and the second intensity information, creating associated prompt information of the subtasks based on the associated tasks, and distributing the subtasks carrying the associated prompt information to corresponding third-level accounts;

S50, when a performance management and control instruction aiming at a task tree is acquired, collecting first completion information and second completion information of each subtask, wherein the first completion information is used for indicating the completion state of the subtask, and the second completion information is used for indicating the completion state of the associated task;

s60, determining a task self score of the subtask based on the first completion information, determining a correction score of the subtask based on the second completion information, and determining a target task score of the subtask based on the task self score and the correction score;

And S70, determining a first performance score, a second performance score and a third performance score based on all target task scores, wherein the first performance score is related to the first grade account, the second performance score is related to the second grade account, and the third performance score is related to the third grade account.

It should be noted that, since the levels of the first level account, the second level account and the third level account are from high to low, and the task tree is created by the first level account, as shown in fig. 2, the number of the first level account is only 1, the number of the second level account and the third level account may be multiple, the first level account may be subordinate to the first level account and the second level account may be multiple, and each second level account may be subordinate to the second level account and the third level account, for example, the first level account is an account of a company management layer, the company management layer manages multiple departments, each department account is the second level account, each department has multiple ordinary staff, each account of each ordinary staff is the third level account, and positions corresponding to the respective level accounts may also be adjusted according to actual conditions. As shown in FIG. 1, the first-level account takes an account A as an example, a plurality of second-level accounts are respectively arranged below the first-level account, namely an account B-1, an account B-2, an account B-1 is respectively arranged below the first-level account, 3 third-level accounts are respectively arranged below the first-level account, namely an account C-1, an account C-2 and an account C-3, 2 third-level accounts are respectively arranged below the account B-2, namely an account C-4 and an account C-5, and 1 third-level account is arranged below the account B-3, namely an account C-6.

It should be noted that, in this embodiment, the account creating the task tree is taken as the first-level account, if the subordinate account is only the second-level account, the operation of the third-level account in this embodiment may be allocated to the second-level account to complete, for example, the corresponding second-level account is configured in the subtask, the configured subtask is allocated to the second-level account, and the corresponding account of each subtask and the task set may be determined.

It should be noted that, the task tree may be directly configured in the performance management system, or may be constructed by importing a file, which is not limited in this embodiment, so that the performance management system may identify the task tree and the corresponding branch structure, and each branch structure may be associated with a corresponding second level account in advance.

When the task tree is configured, the branch structure is used for indicating a plurality of task branches required when completing one integral target, for example, in the field of property, the account A is a company management layer account, the integral target corresponding to the configured task tree is "improving the user experience", the plurality of branch targets can be "improving the cell sanitation", "improving the security service", and "doing the vehicle management", and the like, the branch targets are respectively used as a branch structure, the branch structure of "improving the cell sanitation" is related to the account B-1 of the cleaning department, the branch structure of "improving the security service" is related to the account B-2 of the security department, and the branch structure of "doing the vehicle management" is related to the account B-3 of the property department, so that each department can configure a corresponding task set for the branch target through the corresponding account according to the function of each department. For example, the task set 1 set by the account number B-1 of the cleaning department includes 3 subtasks, namely subtask 1-1, subtask 1-2 and subtask 1-3, wherein the subtask 1-1 is "execute one-time whole-cell cleaning", the subtask 1-2 is "daily maintenance cleaning", the subtask 1-3 is "daily time garbage disposal", and the rest branches are the same, and are not exemplified herein. Of course, a plurality of branch structures may be associated with the same second-level account, and this embodiment does not limit that the branch structures uniquely correspond to the second-level account, and it can be ensured that each branch structure is associated with the second-level account.

After the task tree is constructed, the task tree is issued to each second-level account, and the configuration authority of the corresponding branch structure is opened for each second-level account, so that the configuration of the correct branch structure is ensured. The task set may also be implemented by directly configuring or importing files in the performance management system, which will not be described in detail herein. It should be noted that, in the technical solution of this embodiment, the operation of the subordinate low-level account may be covered by the high-level account, for example, the first-level account may configure each task set, and the second-level account may modify the completion situation of the subtasks, etc.

It should be noted that, the number of the subtasks in each task set may be arbitrary, and a plurality of subtasks in the same task set may form a task chain, or may be a plurality of tasks without a front-to-back relationship, for example, as shown in fig. 2, three subtasks in the task set 1 do not have a front-to-back relationship and can be executed and completed respectively, the subtasks in the task set 2 form a task chain, and the subtasks 2-1 must be completed to execute the subtasks 2-2.

It should be noted that, because the subtasks are configured by the second-level accounts corresponding to the branch structures, when the subtasks are configured by the second-level accounts, the third-level accounts associated with the subtasks are directly designated, and the first intensity information between each subtask is formulated in advance, so that the accuracy of subtask configuration is ensured.

For example, when the subtasks are configured through the department account numbers, the department responsible personnel can know the functions of each common employee in the department, so that the common employee corresponding to each subtask can be designated, the relevance between the subtasks is known, the influence degree between the subtasks can be directly configured as the first intensity information, for example, as shown in fig. 2, continuing to refer to the subtask example of the task set 1, the subtask 1-1 is "performing one-time whole-cell cleaning", the subtask 1-2 is "daily maintenance cleaning", the subtask 1-3 is "daily timing garbage processing", thus completing the subtask 1-1 has a larger help to the subtask 1-2, the subtask 1-1 has an influence to the subtask 1-2, the action intensity 1 can be set as the first intensity information, the execution of the subtask 1-1 can generate more garbage, thus also has a certain relevance relation to the subtask 1-3, the action intensity 2 can be set in advance as the first intensity information, and other subtasks are not repeated here.

It should be noted that, as shown in fig. 2, the action intensity 1 characterizes the subtask 1-1 to have an effect on the subtask 1-2, but the subtask 1-2 does not have an effect on the subtask 1-1, so the first intensity information in this embodiment is directional action intensity, the influence degree of one subtask on another subtask is characterized by the first intensity information, the action intensities of other subtasks may also be set for one subtask, for example, the action intensities of the subtask 1-1 and the subtask 1-3 are set for the subtask 1-1 at the same time, the number of the first intensity information is not limited in this embodiment, the first intensity information of one subtask may include a plurality of action intensities between the subtask and the other subtasks in the same task set, and if there is no effect, the corresponding action intensity may be set to be directly 0. It is noted that while the first intensity information is directional, it is necessary to incorporate it into the scoring calculation between the two subtasks simultaneously in the subsequent performance scoring calculation, except that the weights as input or output are different.

It should be noted that, according to the above description, the second-level accounts corresponding to different branch structures may be different, so each second-level account cannot configure task sets of other second-level accounts because of configuration permission, for example, as shown in fig. 2, account B-1 does not have permission to configure task set 2 and task set 3, so in this embodiment, after each branch structure of the task tree is detected to submit the task set, it may be determined that the topology structure of the task tree completes configuration, the configuration flow of the task tree is transferred to the first-level account, and since the first-level account belongs to an account with a high level, the content of each task set can be configured by utilizing permission downward compatibility, cross-task set configuration is realized by the first-level account, task collaborative configuration of different departments can be realized in the property field, thereby configuring sub-tasks of other departments associated with sub-task configuration of each department, improving flexibility of task configuration, and completing task tree configuration by performing task decomposition in a multi-level collaborative manner.

It should be noted that, the second intensity information may also be similar to the first intensity information, where the difference is that the second intensity information is for a subtask crossing a task set, for example, as shown in fig. 2, the first intensity information of the subtask 1-3 includes an action intensity 2, and the second intensity information is an action intensity 5 with the subtask 2-2 of the task set2, which may of course also include an action intensity with the subtask 2-1, and if the two information are not related, the action intensity may be set to 0, and the description of the action intensity is not repeated here.

After the task set configuration is completed, since the intensity information of all the subtasks is determined, the associated task can be determined based on the first intensity information and the second intensity information, for example, the determination that the first intensity information and the second intensity information are not 0 is the associated task, or a certain action intensity threshold is set, and if the action intensity is greater than the action intensity threshold, the associated task is determined again, which is not limited in this embodiment.

After determining the associated task, the user of the third-level account can simultaneously send the associated prompt information when performing task allocation to the third-level account, so that the user of the third-level account can determine the associated task by checking the associated prompt information, the associated prompt information can record the related information of the associated task and record whether the associated task belongs to a pre-task or a post-task, and the work efficiency after task allocation is improved. Illustratively, the associated prompt may be each column in the table shown in FIG. 2, e.g., the associated prompt of account C-1 records subtask 1-2 and subtask 1-3, and the associated prompt of account C-2 records subtask 1-2, subtask 1-3, and subtask 2-2.

The performance management and control instruction can be triggered by any account, and after the performance management and control instruction is triggered by accounts of different grades, the content which is authorized to be checked by the grade is displayed. For example, after the first level account is triggered, the first performance score, all the second performance scores and all the third performance scores can be checked at the same time, after the second level account is triggered, the second performance score and the subordinate third performance score can be checked, and after the third level account is triggered, only the third performance score can be checked.

It should be noted that, the performance management and control instruction may be automatically triggered to realize performance report after all subtasks are completed, or may be triggered at any time, for example, when the first level account wants to check the current progress, and the task progress is reflected through performance grading.

It should be noted that, the first completion information and the second completion information may be a completion progress or a completion status of the subtasks, for example, the task completion progress is 50% or 100%, or the task completion status is completed, in execution, not started, etc., and the specific representation mode of the completion information is not limited in this embodiment, and the execution progress of the subtasks can be embodied. It is noted that the first completion information and the second completion information belong to one sub-task, the same task progress belongs to different completion information in different sub-tasks, e.g. the task progress for sub-task 1-2 shown in fig. 2, the first completion information for sub-task 1-2, the second completion information for sub-task 1-1, and so on.

In the case of determining the task progress, the scoring mechanism may be set according to the actual requirement to score the progress of the subtask to determine the task score itself, for example, the task progress is used as the actual score, which is not limited in this embodiment. The second completion information is task progress of the associated task, if the associated task is a front task of the subtask, whether the associated task is completed or not has direct influence on whether the subtask can be started or not, if the associated task is a subsequent task of the subtask, execution conditions of the associated task are also directly influenced by the subtask, and if the associated task is a cooperative task of the subtask, task progress of the two tasks are also influenced by each other, therefore, after the second completion information is determined, a correction score is calculated based on the second completion information, and the sum of the task self score and the correction score is determined to be a target task score of the subtask, so that the dimension of the associated task can be introduced when the performance assessment is performed on the subtask, multi-dimensional assessment is realized under the condition that the associated task is more, reference value of the performance score is improved, and flexibility of performance management is improved.

After determining the target task score of each subtask, the step-by-step score statistics can be performed by using the association relationship between the subtask and the third grade account, the association relationship between the third grade account and the second grade account, and the association relationship between the second grade account and the first grade account, a simple step-by-step accumulation calculation method can be adopted, and a correlation coefficient can be introduced for conversion.

According to the technical scheme, a task tree representing the overall target can be constructed through the first level account, and a branch structure representing the branch target is configured in the task tree, so that the overall architecture of performance management is constructed; associating a second level account with each branch structure, configuring subtasks to the second level account to form a task set, recycling the task set to the first level account to configure intensity information of cross branches, and realizing task decomposition and task association of cross departments through cooperation of the multi-level accounts, so that flexibility of performance management can be effectively improved; after the task tree is constructed based on task decomposition, the task tree is automatically issued to a corresponding third-level account, the association relation between subtasks is determined based on the intensity information, the first completion information and the associated second completion information are automatically acquired and calculated in the process of task progress statistics, and the association relation is utilized to carry out score correction, so that the dimension of the associated task can be incorporated in the process of performance score calculation, automatic performance statistics is realized, and the flexibility and the comprehensiveness of performance management are improved.

In addition, referring to fig. 4, in an embodiment, step S30 shown in fig. 1 further includes, but is not limited to, the following steps:

s31, determining task types of all sub-tasks, wherein the task types comprise independent tasks and collaborative tasks;

S32, when the task type of the subtask is an independent task, setting the corresponding first intensity information to zero without adding an intensity configuration item, wherein the intensity configuration item is used for inputting the corresponding second intensity information;

s33, when the task type of the subtask is a cooperative task, applying the pre-configured first intensity information and adding an intensity configuration item;

And S34, associating the second intensity information input through the intensity configuration item to the corresponding subtask.

It should be noted that, in this embodiment, when performing subtask configuration, the task type of the subtask is further specified, where the task type of this embodiment includes a cooperative task of an independent task, and execution of the independent task is not affected by other subtasks, and can be independently executed and completed; a collaborative task means that the execution of one subtask is directly or indirectly affected by other subtasks. For example, referring to FIG. 2, subtask 3-1 is an independent task that has no associated tasks, subtask 3-1 is executed independently and its task progress does not affect other subtasks; other subtasks are collaborative tasks, which can be either a preceding or subsequent task with one subtask as another or multiple subtasks to be executed to achieve a common goal. According to the method and the device, the task types are set, subtasks can be distinguished through the task types, different strategies are adopted to execute in the process of carrying out subsequent calculation, and flexibility of task configuration is improved.

It should be noted that, because the subtask is configured by the second-level account, and the second intensity information is configured by the first-level account, in the field of property, the account with higher level is often less aware of the actual work than the account with lower level, that is, whether the first-level account has association with other tasks or not is not necessarily known, but the second intensity information can be set under the condition of known association relationship, so after the subtask is configured as an independent task by the second-level account, the subtask can be determined not to be associated with other subtasks, so that the intensity configuration item is not added in the independent task, and the first-level account is ensured not to perform the configuration of the related second intensity information. Otherwise, the intensity configuration item is added for the collaboration task, so that the first-level account is ensured to execute the configuration of the related second-intensity information.

For example, the first level account corresponds to a company management layer, the second level account corresponds to a department management layer, and the department management layer is known to the actual work of the property post, but the company management layer does not necessarily know specific work, but judges the degree of association only when the department management layer informs that two works have association, so that for independent tasks, the strength configuration items are not displayed to the company management layer in a task tree, and the accuracy of configuration is effectively improved.

For example, as shown in fig. 2, after completing the configuration of the task set 1 to the task set 3, the first level account obtains the task tree and expands the corresponding branch structure, and for all the subtasks 1-1 to 2, intensity configuration items are displayed, and for the subtask 3-1, intensity configuration items are not displayed.

In addition, referring to fig. 4, in an embodiment, step S40 shown in fig. 1 further includes, but is not limited to, the following steps:

S41, constructing an incidence relation matrix based on the first intensity information and the second intensity information of all the subtasks, wherein the incidence relation matrix is that ，/>For the first intensity information or the second intensity information of the ith subtask to the jth subtask, the ith row matrix element is the first intensity information and the second intensity information of the ith subtask, the jth column matrix element is the first intensity information and the second intensity information of the jth subtask, n is the number of the subtasks, i and j are positive integers, and i epsilon [1, n ], j epsilon [1, n ];

s42, determining the target similarity between each pair of subtasks based on the incidence relation matrix, wherein the target similarity between the ith subtask and the jth subtask ，/>，R is a positive integer,/>For the intensity similarity of the ith row matrix element and the jth row matrix element,/>Intensity similarity for the ith and jth column matrix elements;

S43, determining a pair of subtasks as the associated task of the other party based on the target similarity.

It should be noted that, according to the description of the above embodiment, the first intensity information is the intensity of the actions of the subtasks of the same task set, and the second intensity information is the intensity of the actions of the subtasks of the cross task set, so for one subtask, the union of the first intensity information and the second intensity information is the intensity of the actions of the subtasks of the rest, and the present embodiment constructs the association matrix based on this, and uses the intensity of the actions as each matrix element, and respectively arranges the matrix element in rows and columns twice, and each row and each column respectively corresponds to one subtask, that is, all the intensities of the actions corresponding to one subtask are distributed in both rows and columns. For example, taking n subtasks as an example, summarizing all the task sets to obtain n subtasks, then sequencing, wherein first intensity information exists between the ith subtask and the subtasks of the same task set, and second intensity information exists between the ith subtask and the subtasks of other task sets, so that the 1 st element of the ith row is the action intensity between the ith subtask and the 1 st subtask, the 2 nd element of the ith row is the action intensity between the ith subtask and the 2 nd subtask, and so on; similarly, the 1 st element in the j-th column is the strength of action between the j-th subtask and the 1 st subtask, the 2 nd element in the j-th column is the strength of action between the j-th subtask and the 2 nd subtask, and so on. Of course, the ith element of the ith row is the action strength between the ith subtask and itself, and may be set to 0, and the same applies to the ith subtask, so that the description is not repeated here.

In the association matrix, the action intensity between each subtask is recorded in rows and columns, so if the ratio of the minimum value to the maximum value is taken for the rows and the columns, the difference degree of the action intensity between two subtasks and all other tasks can be represented, for example, the subtask A and the subtask B, for the reference subtask with the sequence number r, the action intensity between the subtask A and the reference subtask and the action intensity between the subtask B and the reference subtask are summed, the minimum value is taken for the summation, the maximum value is taken for the summation, the obtained ratio can represent the similarity degree of the two subtasks, if the two subtasks are completely the same, the calculatedAnd/>Are all 1, calculated/>If the two subtasks are completely unrelated, it can be expected/>AndThe denominator of (1) is necessarily larger than the numerator, so both are smaller than 1, calculated/>Therefore, the method and the device for calculating the association similarity can quantify the association similarity of a specific pair of subtasks by utilizing the action intensity among all subtasks by constructing the OAM matrix, and if the result of the proportional calculation of the action intensity of two subtasks on other subtasks approaches 2, the influence degree of the two subtasks on other subtasks can be determined to be similar, the task with stronger association can be considered as the task with stronger association, thereby providing a data basis for determining the association of the subtasks, automatically determining the association task after the task is decomposed, and improving the accuracy of performance management. For example, after the target similarity is calculated, whether the target similarity has relevance or not may be determined by setting a similarity threshold, for example, the similarity threshold is 1.5, and when the target similarity is greater than 1.5, the target similarity is the relevant task, otherwise, the relevance is considered to be weaker, and the relevant task is not determined.

In addition, in an embodiment, referring to fig. 4, after step S50 is performed, the following steps are included, but not limited to:

s51, determining task input information and task output information of each subtask, wherein the task input information is used for indicating input information acquired before the subtask is switched to a completion state, and the task output information is used for indicating output information triggered after the subtask is switched to the completion state;

S52, satisfaction degree parameter ，/>Inputting information for the task of the ith subtask,/>Output information for the j-th subtask's task,/>() Is a preset satisfaction function, and/>Following/>Increasing progressively;

s53, determining the actual association degree between each pair of subtasks based on the satisfaction parameter, wherein the actual association degree ,/>

S54, when the actual association degree of a pair of subtasks meets a preset association condition, maintaining the corresponding two subtasks as the associated tasks of each other, otherwise, releasing the association relationship;

Wherein, the association condition is:

minT is a preset association threshold,/> For the first subtask,/>For the last subtask, k is a positive integer and k ε [1, n ].

It should be noted that, according to the description of the above embodiment, one subtask may be a pre-task of another subtask, and the output of the pre-task is the input of a subsequent task, or the output of the pre-task is highly similar to the output of the subsequent task, where the satisfaction parameter is calculated by the task input information and the task output information, so that the direct relevance of the two subtasks can be quantified, and the relevance is enhanced when determining the relevance.

The task input information may be description information generated when the task is executed and the task output information may be report information generated after the task is completed. Illustratively, the subtask 2-1 takes cell cleaning as an example, the task input information is "start to clean the cell", the task output information is "finish cell cleaning", the other subtask 2-2 takes garbage disposal as an example, the task input information is "post-cell cleaning garbage", the task output information is "garbage finish", it can be seen that the task output information of the subtask 2-1 is similar to the task input information of the subtask 2-2, so that it can be determined that the subtask 2-1 is a front-end task of the subtask 2-2,Following/>Increment, and in this example/>Similarly, two/>, can be consideredThus calculated/>Increment to make/>The numerical value is larger to represent that the subtasks can meet the requirements.

It should be noted that, according to the description of the above embodiment, the task input information and the task output information may be text information, so that it may be determined whether the task input information and the task output information are similar through semantic recognition, if other forms of information may also be adaptively adjusted, for example, if audio is input, speech recognition is performed, or if the task input information is directly another subtask, simple recognition may be performed through task identification.

It should be noted that, after the calculation of the satisfaction degree parameter is completed, the target similarity is calculated according to the above embodiment, and the target similarity is manually set when the task is decomposed before the task is executed, so that deviation is unavoidable, and the satisfaction degree parameter is calculated based on the task input information and the task output information, and belongs to the actual relevance calculated after the task is executed, so that the actual relevance is calculated after the task is completed, the target similarity can be corrected by using the completed satisfaction degree parameter, and for the two sub-tasks which are associated when the setting is performed, but are not associated when actually executed, contact the relevance relationship, and ensure the accuracy of performance management.

It should be noted that, due to the object similarityThe calculation is carried out according to the action intensity between two subtasks and all other subtasks, so that when the satisfaction parameters are fused, the satisfaction parameters between each pair of subtasks are also required to be summed and calculated to obtain an intermediate parameter/>Then calculate the actual association degree/>, by the same dimensionThe actual association degree can accurately represent the association degree between the two subtasks.

It should be noted that, the association threshold is set according to the actual requirement, the specific numerical value is not limited, and the association threshold is calculated byAfter subtracting the association degree with one other subtask, the real association degree change is smaller, the synchronicity of the subtasks can be determined to be higher, the association is ensured to be stronger, otherwise, the synchronicity is considered to be weaker, the association relation is contacted, the association of the subtasks is ensured through setting and correcting two operations, and the accuracy of performance management is ensured.

In addition, referring to fig. 4, in an embodiment, step S60 shown in fig. 1 further includes, but is not limited to, the following steps:

s61, acquiring a preset first reference score, a preset second reference score and a preset third reference score, wherein the second reference score is smaller than the first reference score, and the third reference score is smaller than the second reference score;

S62, determining a first completion proportion of the subtasks based on the first completion information, and determining a second completion proportion of the associated tasks based on the second completion information;

S63, when the subtasks have no associated tasks, determining a target task score based on the first completion proportion and the first reference score;

s64, when the number of the associated tasks is one, determining a task self score based on the first completion proportion and the second reference score, and determining a correction score based on the second completion proportion and the third reference score;

S65, when the number of the associated tasks is multiple, sorting is performed based on the actual association degree of each associated task, the conversion proportion of each associated task is determined according to the sorting, the conversion score of the associated task is determined based on the second completion proportion, the conversion proportion and the third reference score, and all the conversion scores are summed to obtain a correction score.

It should be noted that, the first completion ratio may be the progress of the subtasks, for example, 0%, 50% or 100% is completed, and the second completion ratio is the same, which is not repeated here.

It should be noted that, for the subtasks without related tasks, that is, the independent tasks in the above embodiment, the assessment only needs to directly determine the calculated task self score as the target task score according to the self completion condition. For subtasks with related tasks, extra collaborative addition may be obtained when the assessment is performed, so that the embodiment sets a first reference score for independent tasks and a second reference score for collaborative tasks, and the first reference score is larger than the second reference score, so that subtasks with lower completion rates are prevented from exceeding the maximum score of the independent completion tasks due to higher correction scores, and the rationality of performance scores is ensured. The third reference score is used to calculate a revised score so that its total score should be less than the second reference score available for completion of the subtask itself. The first reference score is 100 points, the second reference score is 80 points, the third reference score is 20 points, 100 points can be obtained after the independent tasks are completed, 80 points can be obtained after the cooperative tasks are completed, the correction score is 20 points after the related tasks are also completed, the total is 100 points, the uniformity of the scoring standard is ensured, and the reliability of the performance management system is improved. Of course, the specific score may be set according to actual requirements, and is not limited herein.

It should be noted that, when there is only one associated task, the task progress of the associated task may directly determine the correction score, and directly calculate the correction score according to the second completion proportion and the third reference score. When a plurality of related tasks are needed to be sequenced according to the actual association degree, the tasks with strong association are ensured to have higher weight after being completed, the cooperation degree of the tasks is reflected, and the reliability of the performance management system is ensured.

It should be noted that the conversion ratio may be set according to the actual situation, so that the sum of all the conversion ratios is 1, for example, for 4 related tasks, the conversion ratio with the highest actual degree of association is designated as 40%, and then 30%, 20% and 10%, or may be set according to other methods, which are not limited herein.

It should be noted that, after the conversion ratio is determined, the product of the second completion ratio, the conversion ratio and the third reference score may be directly used as a conversion score of an associated task, and all the conversion scores may be summed to obtain the correction score.

In addition, referring to fig. 4, in an embodiment, step S70 shown in fig. 1 further includes, but is not limited to, the following steps:

s71, determining a third performance score of the third-level account based on target task scores of all subtasks corresponding to the third-level account;

s72, determining second performance scores of the second-level accounts based on third account scores of all third-level accounts belonging to the second-level accounts, and determining first performance scores of the first-level accounts based on all second performance scores.

Note that, referring to the task tree shown in fig. 2, the obtained topological relation is shown in the table in fig. 3, and the performance score of each level is obtained according to the summary calculation of the next level, specifically, the following example is used to describe:

For example, for subtask 1-1, since it is not an independent task, the task's own score is calculated according to its own first completion ratio, its associated tasks include subtask 1-2 and subtask 1-3, the correction score is calculated according to the method of the above embodiment, and the sum of the task's own score and the correction score is the target task score of subtask 1-1; for subtask 3-1, the calculated task's own score is the final target task score because it is an independent task.

Further, after calculating the target task scores of the respective subtasks, the account number C-1 relates to the subtask 1-1, so that the target task score of the subtask 1-1 is determined as the third performance score of the account number C-1, the account number C-2 relates to the subtask 1-1 and the subtask 1-2, the target task scores of the subtask 1-1 and the subtask 1-2 are summed as the third performance score of the account number C-2, and other third-level accounts are the same.

Further, the account B-1 is superior to the account C-1, the account C-2, and the account C-3, so that the second performance score of the account B-1 is calculated based on the third performance scores of the three, for example, simple summation may be performed, or normalization processing may be performed after the summation, which is not limited to a specific calculation method. The first performance score for account a is the same and is not repeated here.

In addition, in an embodiment, referring to fig. 4, after step S40 shown in fig. 1 is performed, the following steps are included, but not limited to:

s44, sending task signing matters to the third-level account, and timing based on preset signing time length;

s45, when the signing information aiming at the task signing matters is not acquired before the timing is completed based on the signing time length, signing prompt information is sent to a third-level account, and timing is performed again based on the signing time length;

S46, when the sending times of the signing prompt information reach a preset prompting times threshold value, signing information of the task signing matters is generated.

It should be noted that, after the task is decomposed to obtain a plurality of subtasks, task allocation may be performed according to the configured third-level account, and after the task allocation, it is required to ensure that the corresponding user knows the subtasks, so in this embodiment, timing is performed according to a preset signing time length, when the user who does not acquire signing information to characterize the third-level account before timing is completed receives the corresponding subtasks, the user performs one-time embodiment, and after multiple reminders are not fed back, signing information is automatically generated, so as to ensure normal execution of performance management.

As shown in fig. 5, fig. 5 is a block diagram of a performance management apparatus based on task decomposition according to an embodiment of the present invention. The invention also provides a performance management device based on task decomposition, which comprises:

The processor 501 may be implemented by a general purpose central processing unit (Central Processing Unit, CPU), a microprocessor, an Application SPECIFIC INTEGRATED Circuit (ASIC), or one or more integrated circuits, etc. for executing related programs, so as to implement the technical solution provided by the embodiments of the present application;

The Memory 502 may be implemented in the form of a Read Only Memory (ROM), a static storage device, a dynamic storage device, or a random access Memory (Random Access Memory, RAM). The memory 502 may store an operating system and other application programs, and when the technical solutions provided in the embodiments of the present disclosure are implemented by software or firmware, relevant program codes are stored in the memory 502, and the processor 501 invokes the performance management method based on task decomposition to execute the embodiments of the present disclosure;

an input/output interface 503 for implementing information input and output;

The communication interface 504 is configured to implement communication interaction between the device and other devices, and may implement communication in a wired manner (e.g. USB, network cable, etc.), or may implement communication in a wireless manner (e.g. mobile network, WIFI, bluetooth, etc.);

Bus 505 that transfers information between the various components of the device (e.g., processor 501, memory 502, input/output interface 503, and communication interface 504);

Wherein the processor 501, the memory 502, the input/output interface 503 and the communication interface 504 enable a communication connection between each other inside the device via the bus 505.

The embodiment of the application also provides electronic equipment, which comprises the performance management device based on task decomposition.

The embodiment of the application also provides a storage medium, which is a computer readable storage medium, and the storage medium stores a computer program which realizes the performance management method based on task decomposition when being executed by a processor.

The memory, as a non-transitory computer readable storage medium, may be used to store non-transitory software programs as well as non-transitory computer executable programs. In addition, the memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory remotely located relative to the processor, the remote memory being connectable to the processor through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof. The apparatus embodiments described above are merely illustrative, in which the elements illustrated as separate components may or may not be physically separate, implemented to reside in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

Those of ordinary skill in the art will appreciate that all or some of the steps, systems, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically include computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and may include any information delivery media.

While the preferred embodiment of the present invention has been described in detail, the present invention is not limited to the above embodiments, and those skilled in the art can make various equivalent modifications or substitutions without departing from the spirit and scope of the present invention, and these equivalent modifications or substitutions are included in the scope of the present invention as defined in the appended claims.

Claims

1. A performance management method based on task decomposition, comprising:

determining a first performance score, a second performance score, and a third performance score based on all of the target task scores, wherein the first performance score is associated with the first hierarchical account, the second performance score is associated with the second hierarchical account, and the third performance score is associated with the third hierarchical account;

the obtaining the second intensity information configured by the first level account for each subtask includes:

associating the second intensity information entered through the intensity configuration item to the corresponding subtask;

Wherein said determining an associated task for each of said subtasks based on said first intensity information and said second intensity information comprises:

constructing an association relation matrix based on the first intensity information and the second intensity information of all the subtasks, wherein the association relation matrix is that ，/>For the ith subtask to the jth subtask the first intensity information or the second intensity information, the ith row matrix element is the ith subtask each of the first intensity information and the second intensity information, the jth column matrix element is the jth subtask each of the first intensity information and the second intensity information, n is the number of subtasks, i and j are positive integers, and i epsilon [1, n ], j epsilon [1, n ];

Determining target similarity between each pair of subtasks based on the incidence relation matrix, wherein the target similarity between the ith subtask and the jth subtask ，，/>R is a positive integer;

2. The task decomposition-based performance management method of claim 1, wherein after said collecting the first completion information and the second completion information of each of said subtasks, said method further comprises:

Determining an actual degree of association between each pair of subtasks based on the satisfaction parameter, wherein the actual degree of association ,/>；

Wherein, the association condition is:

minT is a preset association threshold value, For the first of said subtasks,/>For the last of the subtasks, k is a positive integer and k ε [1, n ].

3. The task decomposition-based performance management method of claim 2, wherein said determining a task self score for the subtask based on the first completion information and determining a revised score for the subtask based on the second completion information comprises:

When the number of the associated tasks is one, determining the task self score based on the first completion proportion and the second reference score, and determining a correction score based on the second completion proportion and the third reference score;

4. A task decomposition-based performance management method as claimed in claim 3, wherein said determining a first performance score, a second performance score and a third performance score based on all of said target task scores comprises:

5. The task decomposition-based performance management method of claim 1, wherein after said assigning the subtasks carrying the associated prompt information to the corresponding third level accounts, the method further comprises:

6. A task decomposition-based performance management device comprising at least one control processor and a memory for communication connection with the at least one control processor; the memory stores instructions executable by the at least one control processor to enable the at least one control processor to perform the task decomposition-based performance management method of any one of claims 1 to 5.

7. An electronic device comprising the task decomposition-based performance management apparatus of claim 6.

8. A computer-readable storage medium storing computer-executable instructions for causing a computer to perform the task decomposition-based performance management method of any one of claims 1 to 5.