A project matrix management method and device

Through the project matrix management method, a task node matrix is ​​constructed to promote projects in parallel, solving the problem of low promotion efficiency in PLM technology, realizing flexible task management and parallel R&D, and improving project promotion efficiency and product R&D efficiency.

CN113379368BActive Publication Date: 2024-11-26SHENZHEN BEPSUN IND E-COMMERCE SYST CO LTD +2
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202110504696.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-05-10
Publication Date
2024-11-26
Estimated Expiration
2041-05-10

AI Technical Summary

Technical Problem

The existing PLM technology has problems in project management that are inefficient in promotion efficiency and are not conducive to parallel engineering and talent integration, making it difficult to promote projects in an efficient and parallel manner.

Method used

Using the project matrix management method, we build an intuitive and visual task node matrix, set up root nodes and vertical nodes, realize task decomposition and reuse, support the replication of horizontal nodes and product component version management, and build a super BOM to promote parallel R&D.

Benefits of technology

It improves project promotion efficiency, realizes flexible division and parallel management of tasks, saves time and costs, supports parallel R&D of different product component versions, and improves product R&D efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113379368B_ABST
    Figure CN113379368B_ABST
Patent Text Reader

Abstract

The present invention proposes a project matrix management method and device, including: setting a project root node, the root node is the overall task of the project; adding a number of vertical nodes below the root node, the vertical nodes are the task decomposition of the upper node; adding a number of subordinate vertical nodes to any vertical node; if the vertical node is not a terminal node, the subordinate vertical nodes can continue to be added; wherein the data associated with the root node include project code, project description, general responsible personnel and team, total construction period, total budget, total cost, total schedule and total actual progress; the data associated with each vertical node include task code, task description, executor and team, construction period, budget, cost, schedule and actual progress. Through the present invention, it is not limited to the stage where the task is located, and the advancement of the project can be advanced in parallel on all different levels of nodes based on the project matrix structure, thereby making project management intuitive and improving the efficiency of project advancement.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of R&D system tool software, and in particular to a project matrix management method and device. Background Art

[0002] Project management refers to the combination of various systems, methods and personnel to complete all aspects of a project within the specified time, budget and quality targets. Using information technology to promote project management, thereby accelerating project progress, improving finished product quality and reducing project costs, and thus increasing the success rate of product development, engineering development or technology research, has become a management goal pursued by various enterprises and institutions.

[0003] PLM (Product Lifecycle Management) is the main product development and scientific research project management solution in the existing technology. PLM provides a series of application solutions that support the creation, management, distribution and application of information throughout the product life cycle. It can integrate product life cycle management, processes, application systems and information related to products, and manage product data information throughout the product life cycle from creation to use to final scrapping. In specific implementation, PLM is based on the main line of product life cycle. According to the actual product development process, the development process from the concept formation of the product to the delivery of production is divided into multiple stages, such as product planning, product planning, design development, design verification, mass production release, etc. By setting milestones for each stage and compiling stage plans, the stage plans are decomposed into plans for each field, and then the plans for each field are decomposed into several relatively independent sub-task units. Project tasks are issued step by step. After the responsible person of each sub-task unit accepts the task and completes it, it is submitted to the superior for step-by-step confirmation, thereby completing the entire project. Since the main body of PLM is a milestone-based serial advancement, it is not conducive to the parallel engineering of the entire project, and it is not conducive to the integration of talents from all aspects, and the advancement efficiency is low.

[0004] Therefore, how to efficiently advance the project in an overall and parallel manner has become a technical problem that needs to be solved urgently. Summary of the invention

[0005] The technical problem to be solved by the present invention is how to efficiently advance the project in an overall and parallel manner.

[0006] To this end, according to the first aspect, an embodiment of the present invention discloses a project matrix management method, which is not limited to the stage of the task, and constructs an intuitive and visual task node matrix of the task nodes contained in the project according to the hierarchical relationship, and then implements management based on the project matrix, which specifically includes the following steps:

[0007] Set the root node of the project, which is the overall task of the project;

[0008] Add several vertical nodes below the root node, where the vertical nodes are task decompositions of the upper-level nodes;

[0009] Adding a number of subordinate vertical nodes to any of the vertical nodes, and the multiple vertical nodes belonging to the same upper node are vertical nodes of the same level;

[0010] If the vertical node is not the last node, you can continue to add its subordinate vertical nodes;

[0011] The data associated with the root node include project code, project description, person in charge and team, total construction period, total budget, total cost, total schedule and total actual progress;

[0012] The data associated with each of the vertical nodes include task code, task description, executor and team, duration, budget, cost, schedule and actual progress;

[0013] The construction period associated with each of the vertical nodes is constrained by the total construction period, the budget associated with each of the vertical nodes is constrained by the total budget, the costs associated with each of the vertical nodes together constitute the total cost, the progress plan associated with each of the vertical nodes is constrained by the total progress plan, and the actual progress associated with each of the vertical nodes together constitute the total actual progress.

[0014] Optionally, the method further includes the following steps:

[0015] Add and configure horizontal nodes of the project, which are completed, standardized or generalized reusable tasks;

[0016] Select any one of the horizontal nodes and copy the data associated with it to any selected vertical node;

[0017] The data associated with the horizontal nodes include task code, task description, duration and cost.

[0018] Optionally, for a project whose goal is product development, the vertical node is also associated with a product component obtained by the task, and the product component associated with the subordinate vertical node is a component of the product component associated with the superior vertical node.

[0019] Optionally, the method further includes the following steps:

[0020] Updating the version of the product component associated with any one of the vertical nodes to form a new vertical node at the same level as the original vertical node;

[0021] The data associated with each of the vertical nodes also includes the version number of the product component.

[0022] Optionally, the method further includes the following steps:

[0023] Extracting product components associated with some of the vertical nodes from all the vertical nodes;

[0024] Setting the interchange relationship between the product components;

[0025] Setting the hierarchical relationship between the product components;

[0026] Setting usage data of each of the product components;

[0027] Build a super BOM.

[0028] Optionally, the data associated with the vertical node also includes basic data, verification data, quality data and supplier data of the product components, the basic data includes technical documents and drawings, the verification data includes the equipment involved in the verification and the data of previous verification results, and the quality data includes inspection data and analysis data of product components.

[0029] Optionally, the general responsible person and team have the authority to create, view and modify all the vertical node data, and the executive personnel and team associated with each vertical node have the authority to view and modify the vertical node and create, view and modify all the vertical node data under the vertical node.

[0030] Optionally, the data associated with the vertical node also includes a task approver and an approval status.

[0031] According to a second aspect, an embodiment of the present invention discloses a computer device, including a processor, wherein the processor is used to execute a computer program stored in a memory to implement the project matrix management method of any one of the above-mentioned first aspects.

[0032] According to a third aspect, an embodiment of the present invention discloses a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the project matrix management method of any one of the above-mentioned first aspects.

[0033] The present invention has the following beneficial effects:

[0034] (1) Project management is done through a project matrix, which is not limited to the stage of the task. The task nodes contained in the project are constructed into an intuitive and visual task node matrix according to the hierarchical relationship. Task nodes can be flexibly divided and added on this matrix, and the position or role of each task in the entire project can be intuitively reflected. The project can be promoted in parallel at all different levels of nodes based on the project matrix structure, making project management intuitive and improving the efficiency of project promotion;

[0035] (2) By setting up horizontal nodes in the project matrix, completed, standardized or generalized reusable tasks can be flexibly reused, saving time and reducing costs;

[0036] (3) The project matrix can fully display all versions of all product components in the project. Each product component version is associated with a vertical node and incorporated into the overall management of the project as a branch task, which is conducive to the parallel advancement of the research and development of different product components and different product component versions;

[0037] (4) For a project matrix, product components associated with different vertical nodes can be selected multiple times to build multiple different super BOMs. Under a project matrix, multiple related products can be developed in parallel, which improves the efficiency of product development. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0039] Figure 1 It is a schematic diagram of a project matrix structure disclosed in this embodiment;

[0040] Figure 2 This is a schematic diagram of the second project matrix structure disclosed in this embodiment;

[0041] Figure 3 This is a third schematic diagram of the project matrix structure disclosed in this embodiment. DETAILED DESCRIPTION

[0042] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0043] The present invention provides an embodiment of a project matrix management method, wherein the formed project matrix is ​​shown in Figure 1 , including the following steps:

[0044] S100: Set the root node 100 of the project, which is the overall task of the project;

[0045] S200: Add several vertical nodes (110, 120, 130, 140, 150) below the root node 100, where the vertical nodes (110, 120, 130, 140, 150) are task decompositions of the upper-level nodes;

[0046] S300: adding a number of subordinate vertical nodes to any vertical node, and the multiple vertical nodes belonging to the same upper node are vertical nodes of the same level;

[0047] It should be noted that step S300 can be executed multiple times. For example, add the subordinate vertical nodes 141 and 142 to the vertical node 140, add the subordinate vertical node 151 to the vertical node 150, and add the subordinate vertical nodes 1511 and 1512 to the vertical node 151. If the vertical node is not a terminal node, its subordinate vertical nodes can continue to be added. The task represented by the terminal node cannot be further decomposed.

[0048] In the constructed project matrix, the data associated with the root node include project code, project description, general responsible person and team, total duration, total budget, total cost, total schedule and total actual progress, and the data associated with each vertical node include task code, task description, executor and team, duration, budget, cost, schedule and actual progress. The duration associated with each vertical node is constrained by the total duration, the budget associated with each vertical node is constrained by the total budget, the costs associated with each vertical node together constitute the total cost, the schedule associated with each vertical node is constrained by the total schedule, and the actual progress associated with each vertical node together constitutes the total actual progress.

[0049] In some embodiments, if the progress plans and actual progress of all vertical nodes are managed in a coordinated manner, a ranking of the progress plans and actual progress of all vertical nodes in the project matrix can be formed.

[0050] In some embodiments, step S200 can be executed again after step S300 is executed, and the number of executions is not limited, which means that the project tasks can be flexibly decomposed or branch tasks of the project can be added at any stage of project implementation.

[0051] It should be noted that, in the embodiment of the present invention, the projects involved in the root node and each vertical node can be product development projects, engineering development projects or research and consulting projects. As an example, for product development projects, the root node of the project matrix can be automobile development, and its subordinate vertical nodes can be engine development, chassis development, body development, electrical equipment development, etc., and the vertical nodes under chassis development can be transmission system development, driving system development, steering system development, and brake system development; for engineering development projects, the root node of the project matrix can be building engineering development, and its subordinate vertical nodes can be foundation and foundation engineering development, main structure engineering development, building roof engineering development, building decoration and decoration engineering development, building water supply and drainage and heating engineering development, ventilation and air conditioning engineering development, elevator engineering development, building electrical engineering development, intelligent building engineering development, etc.; for research and consulting projects, the root node of the project matrix can be hot runner injection molding technology research, and its subordinate vertical nodes can be mold technology research, injection molding machine technology research, plastic mechanism research, hot runner injection molding analysis system research, etc.

[0052] Project management through the project matrix is ​​not limited to the stage of the task. The task nodes contained in the project are constructed into an intuitive and visual task node matrix according to the hierarchical relationship. Task nodes can be flexibly divided and added on this matrix, and the position or role of each task in the entire project can be intuitively reflected. The advancement of the project can be carried out in parallel on all nodes at different levels based on the project matrix structure, making project management intuitive and improving the efficiency of project advancement.

[0053] In an optional embodiment, the project matrix formed is as follows: Figure 2 , the project matrix management method also includes the following steps:

[0054] S400: Add and configure the horizontal nodes (201, 202) of the project, where the horizontal nodes (201, 202) are completed, standardized or generalized reusable tasks;

[0055] S500: Select any horizontal node (201, 202) and copy its associated data to any vertical node;

[0056] The data associated with the horizontal nodes (201, 202) include task code, task description, duration and cost.

[0057] It should be noted that the horizontal nodes are extracted from completed projects and can be used as standard parts for subsequent projects, and their construction period and cost are relatively fixed. In some embodiments, after the data associated with the horizontal nodes are copied to the vertical nodes, the associated data of the vertical nodes can continue to be adjusted and set. In some embodiments, step S400 and step S500 can be executed multiple times without limiting the order, which means that horizontal nodes can be added and used arbitrarily. Through the setting of horizontal nodes in the project matrix, completed, standardized or generalized reusable tasks can be flexibly reused, saving time and reducing costs.

[0058] In an optional embodiment, for projects whose goal is product development, the vertical nodes are also associated with product components obtained by the tasks, and the product components associated with the subordinate vertical nodes are components of the product components associated with the upper vertical nodes.

[0059] For example, in a complete vehicle R&D project, the product component obtained through the chassis R&D task is the chassis, and the product component obtained through the driving system R&D task is the driving system. The driving system R&D task is the decomposition of the chassis R&D task, and the driving system product component is also a part of the chassis product component.

[0060] In an optional embodiment, the project matrix management method further includes the following steps:

[0061] S600: Updating the version of the product component associated with any vertical node to form a new vertical node at the same level as the original vertical node;

[0062] The data associated with each vertical node also includes the version number of the product component.

[0063] It should be noted that step S600 can be executed multiple times without limiting the order, which means that the product components generated by the vertical node tasks can be flexibly updated, providing a more flexible change management method. The project matrix can fully display all versions of all product components in the project. Each product component version is associated with a vertical node and is included in the overall management of the project as a branch task, which is conducive to the parallel advancement of the research and development of different product components and different product component versions.

[0064] In an optional embodiment, the project matrix management method further includes the following steps:

[0065] S701: arbitrarily extract product components associated with some of the vertical nodes from all the vertical nodes;

[0066] S702: Setting the interchange relationship between product components;

[0067] S703: Setting the hierarchical relationship between product components;

[0068] S704: Setting usage data of each product component;

[0069] S705: Build super BOM.

[0070] As an example, see Figure 3 When constructing a product, only one of the interchangeable product components can be selected, but the super BOM can contain interchangeable parts, and the product components with interchangeable relationships can be selected to construct the super BOM, for example, Figure 3 The product components associated with the longitudinal nodes 110 and 120 are set to be interchangeable, and the product components associated with the longitudinal nodes 110 and 120 can be selected at the same time to construct a super BOM. Since a super BOM can contain sub-BOMs, product components with hierarchical relationships can be selected to form a super BOM. For example, the subordinate nodes of the longitudinal node 151 are the longitudinal nodes 1511 and 1512, and the product components associated with the longitudinal nodes 1511 and 1512 are components of the product components associated with the longitudinal node 1511. The product components associated with the longitudinal nodes 151, 1511, and 1512 can be selected at the same time to construct a super BOM, wherein the product components associated with the longitudinal nodes 151, 1511, and 1512 can form sub-BOMs.

[0071] For the specific definition and construction method of super BOM, please refer to the contents disclosed in Chinese patent applications CN201710878530.X, CN202010136898.0 and CN202010136195.8, which will not be repeated here.

[0072] It should be noted that after step S701 is executed, step S702 and step S703 may be adaptively selected for execution according to whether the selected product components have an interchangeable relationship or a hierarchical relationship.

[0073] For a project matrix, you can select product components associated with different vertical nodes multiple times to build multiple different super BOMs. Therefore, under a project matrix, multiple related products can be developed in parallel, improving the efficiency of product development.

[0074] In an optional embodiment, the data associated with the vertical node also includes basic data, verification data, quality data and supplier data of product components. The basic data includes technical documents and drawings, and the verification data includes equipment involved in the verification and previous verification processes and results data.

[0075] It should be noted that the verification of product components includes research, testing or trials, and the verification data of product components includes the equipment involved in the research, testing or trials, such as the equipment, tools or instruments involved. Multiple research, testing or trials can be carried out for the product components associated with each longitudinal node. The verification data of product components also includes the process and result data of previous research, testing or trials, such as research and trial orders, test reports or trial reports. Quality data includes the inspection data and analysis data of product components.

[0076] In an optional embodiment, the general responsible personnel and team have the authority to create, view and modify all vertical node data, and the executive personnel and team associated with each vertical node have the authority to view and modify the vertical node and create, view and modify all vertical node data under the vertical node.

[0077] In an optional embodiment, the data associated with the vertical node also includes the task approver and the approval status.

[0078] It should be noted that the approval status includes approved and not approved. When the approval status associated with a vertical node is approved, it indicates that the task represented by the vertical node has been completed.

[0079] In an optional embodiment, the data associated with the vertical node also includes the node's R&D maturity. During the development process, the node's R&D maturity can usually be identified as undetermined and finalized, where undetermined can be subdivided into trial production, under revision, with quality issues, and new customer requirements.

[0080] In addition, an embodiment of the present invention further provides a computer device, wherein a processor executes computer instructions to implement the following method:

[0081] Set the root node of the project, which is the overall task of the project;

[0082] Add several vertical nodes below the root node, where the vertical nodes are task decompositions of the upper-level nodes;

[0083] Adding a number of subordinate vertical nodes to any of the vertical nodes, and the multiple vertical nodes belonging to the same upper node are vertical nodes of the same level;

[0084] If the vertical node is not the last node, you can continue to add its subordinate vertical nodes;

[0085] The data associated with the root node include project code, project description, person in charge and team, total construction period, total budget, total cost, total schedule and total actual progress;

[0086] The data associated with each of the vertical nodes include task code, task description, executor and team, duration, budget, cost, schedule and actual progress;

[0087] The construction period associated with each of the vertical nodes is constrained by the total construction period, the budget associated with each of the vertical nodes is constrained by the total budget, the costs associated with each of the vertical nodes together constitute the total cost, the progress plan associated with each of the vertical nodes is constrained by the total progress plan, and the actual progress associated with each of the vertical nodes together constitute the total actual progress.

[0088] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program, and the program can be stored in a computer-readable storage medium. When the program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, the storage medium can be a disk, an optical disk, a read-only storage memory (ROM) or a random access memory (RAM), etc. The computer processor is used to execute the computer program stored in the storage medium to implement the following method:

[0089] Set the root node of the project, which is the overall task of the project;

[0090] Add several vertical nodes below the root node, where the vertical nodes are task decompositions of the upper-level nodes;

[0091] Adding a number of subordinate vertical nodes to any of the vertical nodes, and the multiple vertical nodes belonging to the same upper node are vertical nodes of the same level;

[0092] If the vertical node is not the last node, you can continue to add its subordinate vertical nodes;

[0093] The data associated with the root node include project code, project description, person in charge and team, total construction period, total budget, total cost, total schedule and total actual progress;

[0094] The data associated with each of the vertical nodes include task code, task description, executor and team, duration, budget, cost, schedule and actual progress;

[0095] The construction period associated with each of the vertical nodes is constrained by the total construction period, the budget associated with each of the vertical nodes is constrained by the total budget, the costs associated with each of the vertical nodes together constitute the total cost, the progress plan associated with each of the vertical nodes is constrained by the total progress plan, and the actual progress associated with each of the vertical nodes together constitute the total actual progress.

[0096] Obviously, the above embodiments are merely examples for clear explanation, and are not limitations on the implementation methods. For ordinary technicians in the relevant field, other different forms of changes or modifications can be made on the basis of the above description. These should also be regarded as the scope of protection of the present invention, which will not affect the effect of the implementation of the present invention and the practicality of the patent. It is not necessary and impossible to list all the implementation methods here. The scope of protection required by this application shall be based on the content of its claims, and the specific implementation methods and other records in the specification can be used to interpret the content of the claims. The obvious changes or modifications derived from this are still within the scope of protection created by the present invention.

Claims

1. A project matrix management method, characterized in that: Not limited to the stage of the task, the task nodes contained in the project are constructed into an intuitive and visual task node matrix according to the hierarchical relationship, and then the management based on the project matrix is ​​implemented, which includes the following steps: Set the root node of the project, which is the overall task of the project; Add several vertical nodes below the root node, where the vertical nodes are task decompositions of the upper-level nodes; Adding a number of subordinate vertical nodes to any of the vertical nodes, and the multiple vertical nodes belonging to the same upper node are vertical nodes of the same level; If the vertical node is not the last node, you can continue to add its subordinate vertical nodes; For a project whose goal is product development, the vertical node is also associated with a product component obtained by the task, and the product component associated with the subordinate vertical node is a component of the product component associated with the superior vertical node; Updating the version of the product component associated with any one of the vertical nodes to form a new vertical node at the same level as the original vertical node; The data associated with each of the vertical nodes also includes the version number of the product component; Add and configure horizontal nodes of the project, which are completed, standardized or generalized reusable tasks; Select any one of the horizontal nodes and copy the data associated with it to any selected vertical node; Constructing a super BOM, specifically: extracting product components associated with some of the vertical nodes from all the vertical nodes; setting the interchange relationship between the product components, setting the hierarchical relationship between the product components, and setting the usage data of each of the product components; The data associated with the root node include project code, project description, person in charge and team, total construction period, total budget, total cost, total schedule and total actual progress; The data associated with each of the vertical nodes include task code, task description, executor and team, duration, budget, cost, schedule and actual progress; The construction period associated with each of the vertical nodes is constrained by the total construction period, the budget associated with each of the vertical nodes is constrained by the total budget, the costs associated with each of the vertical nodes together constitute the total cost, the progress plan associated with each of the vertical nodes is constrained by the total progress plan, and the actual progress associated with each of the vertical nodes together constitute the total actual progress; The data associated with the horizontal nodes include task code, task description, duration and cost.

2. A project matrix management method as claimed in claim 1, characterized in that: The data associated with the vertical nodes also include the basic data, verification data, quality data and supplier data of the product components. The basic data includes technical documents and drawings. The verification data includes the equipment involved in the verification and the data of previous verification results. The quality data includes the inspection data and analysis data of the product components.

3. A project matrix management method as claimed in claim 1, characterized in that: The general responsible person and team have the authority to create, view and modify all the vertical node data, and the executive personnel and team associated with each vertical node have the authority to view and modify the vertical node and create, view and modify all the vertical node data under the vertical node.

4. A project matrix management method as claimed in claim 1, characterized in that: The data associated with the vertical node also includes the task approver and the approval status.

5. A computer device, characterized in that: It includes a processor, which is used to execute a computer program stored in a memory to implement the project matrix management method as described in any one of claims 1 to 4.

6. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the project matrix management method as described in any one of claims 1 to 4 is implemented.