A scheduling system and method based on nuclear engineering work plan
By designing the scheduling system based on the nuclear engineering work plan, automated processing task relationships and identification of front conditions, the problem of difficulty in processing difficulties and artificial intervention in the management of nuclear engineering project management, and achieve significant improvement of project management efficiency Essence
Patent Information
- Application Number
- CN202410528342.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-04-29
- Publication Date
- 2025-01-28
- Estimated Expiration
- 2044-04-29
AI Technical Summary
There are problems in the management of existing nuclear engineering projects that are difficult to handle complex task relationships, inaccurate identification of preconditions, high degree of manual intervention, and low project management efficiency.
Designed a scheduling system based on nuclear engineering work plan, including data reading module, task analysis module, task overlap and constraints, key path calculation modules and planning scheduling modules. , Identify the front conditions, calculate the key path and generate project schedule.
Achieving complex task relationships, accurate identification of front conditions, and reducing the degree of artificial intervention have been achieved, it has significantly improved the efficiency of project management and adapted to the complexity and professional needs of nuclear engineering.
Smart Images

Figure CN118333277B_ABST
Abstract
Description
Background Art
[0002] In the field of modern nuclear engineering, the implementation of large-scale projects presents the characteristics of large scale, complex technology, multi-task interweaving and high dependence on preconditions. These projects cover the whole process from design, procurement, construction, commissioning to operation and maintenance, involving many professional subsystems and interdisciplinary technology integration. Traditional project management methods often face many challenges when facing such a complex engineering system: Task relationship complexity: The task network structure of nuclear engineering projects is intricate, and the interdependence between tasks may be manifested in multiple forms such as parallel, serial, mutually exclusive, and nested, and even there are loops and condition-triggered task chains. Accurately grasping these relationships is crucial for the reasonable arrangement of construction schedules and allocation of resources, but it is extremely difficult to sort them out manually. Precondition diversity: The start of each task is often subject to a variety of preconditions, such as design drawing approval, arrival of key equipment, and completion of specific processes. The time for achieving these conditions is uncertain and may affect each other, making it difficult to accurately predict the start time of the task, further increasing the uncertainty of the project plan. Limitations of manual management: At present, the task decomposition and scheduling of nuclear engineering projects mainly rely on manual work. Professionals need to rely on deep professional knowledge and rich experience to manually analyze task structures, identify critical paths, estimate working hours, and allocate resources. However, manual processing is not only inefficient, but also easily affected by factors such as human fatigue and cognitive bias, resulting in inaccurate task division and errors in construction period prediction. It also requires extremely high technical literacy and experience of the participants, which is not conducive to the standardization and scale of project management. The technical threshold is too high: The particularity and complexity of nuclear engineering projects make the technical requirements for project managers and team members much higher than general engineering projects. They must not only be proficient in nuclear engineering professional knowledge, but also master advanced project management skills, including but not limited to risk management, supply chain coordination, regulatory compliance, etc. This undoubtedly increases the difficulty of talent selection and training, and also limits the expansion and efficiency improvement of the project management team.
[0003] In view of the above problems, the existing planning and scheduling methods of nuclear engineering projects are in urgent need of innovation. The industry urgently needs a technical solution that can automatically handle complex task relationships, accurately identify preconditions, effectively reduce the degree of manual intervention, and significantly improve project management efficiency. The ideal system should be able to automatically unravel the complex nuclear engineering tasks, accurately identify key task paths, intelligently generate and dynamically adjust project schedules, thereby significantly reducing the burden on managers, improving the accuracy and efficiency of project execution, and adapting to the growing complexity and professional needs in the field of nuclear engineering. Such technological innovations will not only help optimize project resource allocation, shorten construction periods, and reduce costs, but also reduce the requirements for personnel technical thresholds through standardization and intelligent means, and promote a leap in the level of project management in the entire nuclear engineering industry. Summary of the invention
[0004] In order to solve the above problems in the prior art, that is, the existing nuclear engineering project scheduling is only performed through manual analysis, which has errors and high technical thresholds, the present invention provides a scheduling system based on the nuclear engineering work plan, the system comprising:
[0005] a data reading module configured to obtain a nuclear engineering plan;
[0006] A task parsing module configured to extract raw task data from the nuclear engineering plan;
[0007] A task overlap and constraint extraction module, configured to obtain the overlap relationship, constraint conditions and restriction requirements between tasks from the original task data according to preset rules;
[0008] A critical path calculation module is configured to calculate the key tasks and then calculate the critical path through a critical path algorithm based on the overlap relationship, constraint conditions and restriction requirements;
[0009] The planning and scheduling module is configured to complete and display the work plan according to the critical path.
[0010] Furthermore, the task parsing module is specifically:
[0011] Based on the nuclear engineering plan, extract all task names, hierarchical relationships and overlapping relationships;
[0012] Based on the task names and hierarchical relationships, constructing tree-like hierarchical data of the nuclear engineering plan through a multi-node tree-like construction algorithm;
[0013] Based on the tree hierarchy, time attributes and task names are filled into the tasks in the tree hierarchy data in a preset format to obtain original task data.
[0014] Furthermore, the task connection and constraint extraction module is specifically:
[0015] Based on the original task data, various types of constraint information are identified, the preceding and following relationships of the tasks are obtained, and the restriction types and restriction conditions of the tasks are read. Task constraint matrix data is constructed based on the constraint information through a structural matrix algorithm, and then task constraint data is identified.
[0016] Furthermore, the key tasks are obtained by:
[0017] Taking tasks as nodes of a network plan graph, drawing arrows of the network plan graph according to the overlap relationship, drawing weights of the network plan graph according to constraint conditions, and constructing a data model;
[0018] Loading constraints in the data model through a key task algorithm;
[0019] Based on the loaded constraints, the earliest start time and earliest finish time of each task are calculated by forward push method;
[0020] Based on the loaded constraints, the latest start time and latest completion time of each task are calculated by reverse calculation;
[0021] Calculate the difference between the latest start time and the earliest start time of each task, and set the task whose difference between the latest start time and the earliest start time is 0 as a critical task.
[0022] Furthermore, the earliest start time is calculated as follows:
[0023] The maximum value of the earliest completion time of all predecessor tasks of the current task and the sum of the constraints of type delay.
[0024] Furthermore, the latest start time is calculated as follows:
[0025] The sum of the earliest start time of the current task and the working duration of the current task.
[0026] Furthermore, the latest completion time is calculated as follows:
[0027] The minimum difference between the latest start time of all subsequent tasks of the current task and the delay constraint.
[0028] Furthermore, the latest start time is calculated as follows:
[0029] The latest finish time of the current task, minus the working duration of the current task.
[0030] Furthermore, the critical path is obtained by:
[0031] Construct a critical task list according to the overlap relationships, constraints, restriction requirements, parallel tasks of critical tasks, and open tasks of critical tasks;
[0032] According to the time overlapping relationship of each task in the critical task list, one or more critical task paths with the longest time overlapping relationship are selected, and the attributes of the critical task paths are filled to obtain the critical path.
[0033] Furthermore, it also includes a risk transmission module configured to obtain the actual progress and completion status of the task in real time according to the work plan scheduling;
[0034] If the actual progress of a task exceeds the set ratio threshold of the work plan scheduling, the task will be recorded as a risk source task;
[0035] Re-enter the data reading module to obtain the current unfinished nuclear engineering plan, and find the second critical path containing the risk source task through the task analysis module, task overlap and constraint condition extraction module and critical path calculation module;
[0036] According to the overdue ratio of the risk source task exceeding the work plan schedule, multiply the time of each task in the second critical path by the overdue ratio to obtain the new expected time of the second critical path;
[0037] Replace the time of all tasks in the second critical path into the current unfinished nuclear engineering plan to obtain a nuclear engineering plan with risk transmission;
[0038] Find the third critical path through the task analysis module, task overlap and constraint extraction module, and critical path calculation module;
[0039] Through the planning and scheduling module, the new work plan is completed and displayed according to the third critical path.
[0040] Another aspect of the present invention provides a scheduling method based on a nuclear engineering work plan, the method comprising:
[0041] Step S1, obtaining a nuclear engineering plan;
[0042] Step S2, extracting original task data from the nuclear engineering plan;
[0043] Step S3, obtaining the overlapping relationship, constraint conditions and restriction requirements between tasks from the original task data according to preset rules;
[0044] Step S4, based on the overlap relationship, constraint conditions and restriction requirements, calculate the key tasks through a critical path algorithm, and then calculate the critical path;
[0045] Step S5, completing the work plan scheduling according to the critical path and displaying it.
[0046] Beneficial effects of the present invention:
[0047] (1) The present invention is a technical solution that can automatically process complex task relationships, accurately identify preconditions, effectively reduce the degree of manual intervention, and significantly improve project management efficiency. It can automatically unravel the complex nuclear engineering tasks, accurately identify key task paths, intelligently generate and dynamically adjust project schedules, thereby significantly reducing the burden on management personnel, improving the accuracy and efficiency of project execution, and adapting to the growing complexity and professional needs in the nuclear engineering field. It not only helps to optimize project resource allocation, shorten construction periods, and reduce costs, but also reduces the requirements for personnel technical thresholds through standardization and intelligent means, and promotes a leap in the level of project management in the entire nuclear engineering industry. BRIEF DESCRIPTION OF THE DRAWINGS
[0048] Other features, objects and advantages of the present application will become more apparent by reading the detailed description of non-limiting embodiments made with reference to the following drawings:
[0049] Figure 1 is a logical schematic diagram of a scheduling system based on a nuclear engineering work plan in an embodiment of the present invention;
[0050] Figure 2 It is a schematic diagram of a data model constructed in an embodiment of the present invention. DETAILED DESCRIPTION
[0051] The present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the relevant invention, rather than to limit the invention. It is also necessary to explain that, for ease of description, only the parts related to the relevant invention are shown in the accompanying drawings.
[0052] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.
[0053] In order to more clearly explain the scheduling system based on the nuclear engineering work plan of the present invention, the following is combined with Figure 1 Each functional module in the embodiment of the present invention is described in detail.
[0054] A scheduling system based on a nuclear engineering work plan according to a first embodiment of the present invention includes a data reading module, a task parsing module, a task overlap and constraint condition extraction module, a critical path calculation module and a planning and scheduling module. Each functional module is described in detail as follows:
[0055] Nuclear engineering processes are complex, with many task items and many calculation constraints and restrictions on critical paths. The commonly used PERT charts and Gantt charts have limited display effects. It is necessary to constantly absorb the latest user needs, the latest products, and the latest technologies to make the project progress display more effective and intuitive.
[0056] The critical path is the longest path in a project, which determines the shortest completion time of the entire project. Critical path analysis is an important tool in project management, which is used to determine the key tasks and critical paths in a project, so as to timely discover and solve problems that may cause project delays. Nuclear engineering processes are complex, with many task items, and many inputs and restrictions on the calculation constraints of the critical path. The commonly used PERT chart and Gantt chart have limited display effects. It is necessary to constantly absorb the latest user needs, the latest products, and the latest technologies to make the display of engineering progress more effective and intuitive.
[0057] In the existing methods, task scheduling is usually based on ordinary manual task analysis, which is inefficient and prone to manual errors, requires high technical level, and has a large human cost. The scheduling software component of the present invention based on the nuclear engineering work plan proposes a task analysis algorithm, a task overlap and constraint condition algorithm, a critical path algorithm, a classic network plan diagram critical path algorithm, and a graphic integrated display algorithm, which greatly reduces manual errors, improves accuracy, and is more efficient, greatly reducing costs.
[0058] The data reading module is configured to obtain a nuclear engineering plan; in the read nuclear engineering plan, all data include attributes such as name, hierarchical relationship, original duration, remaining duration and planned completion percentage.
[0059] A task parsing module configured to extract raw task data from the nuclear engineering plan;
[0060] Usually in nuclear engineering, the data shown in Table 1 are obtained based on construction content, operation methods, management requirements, etc. However, these data include WBS data representing the decomposition level and the executed task data, that is, it is impossible to intuitively display the data level or the order of the data.
[0061] Table 1 Original task data obtained
[0062] Task Code Task Status WBS Code Task Name start Finish A10000 Not started ZHHH-SS.1 Project team building and project planning 2023 / 10 / 7 08:00 2023 / 10 / 11 17:30 A10001 Not started ZHHH-SS.1 R&D environment preparation 2023 / 10 / 12 08:30 2023 / 10 / 18 17:30 A10010 Not started ZHHH-SS.2 Demand research, data collection 2023 / 10 / 19 08:30 2023 / 11 / 1 17:30 A10020 Not started ZHHH-SS.2 Research and analysis report discussion, writing and reporting 2023 / 11 / 2 08:30 2023 / 11 / 8 17:30 A10065 Not started ZHHH-SS.3 Detailed design document review 2023 / 12 / 21 08:30 2023 / 12 / 27 17:30 A10040 Not started ZHHH-SS.3 Product design briefing, product prototype design 2023 / 11 / 23 08:30 2023 / 12 / 6 17:30 A10050 Not started ZHHH-SS.3 Preparation of detailed technical solutions for products 2023 / 12 / 7 08:30 2023 / 12 / 20 17:30 A10060 Not started ZHHH-SS.3 Prepare interface plan 2023 / 12 / 7 08:30 2023 / 12 / 13 17:30 A10070 Not started ZHHH-SS.4.1 Progress algorithm development 2023 / 12 / 28 08:30 2024 / 1 / 4 17:30 A10080 Not started ZHHH-SS.4.2 3D display function development 2023 / 12 / 28 08:30 2024 / 1 / 4 17:30 A10090 Not started ZHHH-SS.4.2 Development of 3D component management function 2024 / 1 / 5 08:30 2024 / 1 / 11 17:30 A10100 Not started ZHHH-SS.4.2 Development of schedule and 3D component related functions 2024 / 1 / 12 08:30 2024 / 1 / 25 17:30
[0063] In this embodiment, the task parsing module is specifically:
[0064] Based on the nuclear engineering plan, extract all task names, hierarchical relationships and overlapping relationships;
[0065] Based on the task names and hierarchical relationships, constructing tree-like hierarchical data of the nuclear engineering plan through a multi-node tree-like construction algorithm;
[0066] Through the multi-node tree construction algorithm, the WBS data representing the decomposition level is sorted from top to bottom, and the WBS code and the subordinate parent WBS code are given to each layer of data in the classification and grouping order to form a WBS code with a subordinate relationship. In this way, the WBS data hierarchical relationship is constructed. Then, according to the management requirements, the task data is reallocated to a certain WBS to form a subordinate relationship between WBS and tasks. Finally, according to the work content and the clear task execution order according to the logical relationship of nuclear power construction operations, the task overlap relationship is formed as shown in Table 2:
[0067] Table 2 Nuclear engineering plan tree level data
[0068] Task Code Task Status WBS Code Task Name start Finish Tiers Parent WBS Code Business-related task code Business Relationship A10000 Not started ZHHH-SS.1 Project team building and project planning 2023 / 10 / 7 8:00 2023 / 10 / 1117:30 1 A10001 Not started ZHHH-SS.1 R&D environment preparation 2023 / 10 / 12 8:30 2023 / 10 / 1817:30 1 A10010 Not started ZHHH-SS.2 Demand research, data collection 2023 / 10 / 19 8:30 2023 / 11 / 117:30 1 ZHHH-SS.1 Post A10020 Not started ZHHH-SS.2 Research and analysis report discussion, writing and reporting 2023 / 11 / 2 8:30 2023 / 11 / 817:30 1 A10065 Not started ZHHH-SS.3 Detailed design document review 2023 / 12 / 21 8:30 2023 / 12 / 2717:30 1 A10040 Not started ZHHH-SS.3 Product design briefing, product prototype design 2023 / 11 / 23 8:30 2023 / 12 / 617:30 1 A10050 Not started ZHHH-SS.3 Preparation of detailed technical solutions for products 2023 / 12 / 7 8:30 2023 / 12 / 2017:30 1 ZHHH-SS.2 Pre A10060 Not started ZHHH-SS.3 Prepare interface plan 2023 / 12 / 7 8:30 2023 / 12 / 1317:30 1 A10070 Not started ZHHH-SS.4.1 Progress algorithm development 2023 / 12 / 28 8:30 2024 / 1 / 417:30 2 ZHHH-SS.4 A10080 Not started ZHHH-SS.4.2 3D display function development 2023 / 12 / 28 8:30 2024 / 1 / 417:30 2 ZHHH-SS.4 A10140 Not started ZHHH-SS.4.3 Cloud platform testing and bug resolution 2024 / 2 / 16 8:30 2024 / 2 / 2217:30 2 ZHHH-SS.4
[0069] Based on the tree hierarchy, time attributes and task names are filled into the tasks in the tree hierarchy data in a preset format to obtain original task data.
[0070] The WBS data format is divided into two parts: basic data and management data. The basic data format includes but is not limited to: name, code, parent code, level, start time, completion time, etc.; the management data format includes but is not limited to: nuclear project, sub-items, management entity, responsible entity, etc.
[0071] The task data format is divided into four parts: basic data, subordinate data, overlap data, and management data. The basic data format includes but is not limited to: name, code, start time, completion time, etc.; the subordinate data format includes but is not limited to: subordinate WBS code, subordinate WBS name, etc.; the overlap data format includes but is not limited to: overlap task code, overlap task name, overlap type, overlap delay, etc.; the management data format includes but is not limited to: affiliated nuclear project, affiliated sub-item, management entity, responsible entity, etc.
[0072] The preset format is designed to meet the nuclear engineering requirement of "full traceability and traceability throughout the entire process". It is formed based on the task data commonly used in other industries and with additional traceability management requirements.
[0073] A task overlap and constraint extraction module, configured to obtain the overlap relationship, constraint conditions and restriction requirements between tasks from the original task data according to preset rules;
[0074] The main task of the task overlap and constraint algorithm is to automatically extract the relevant overlap relationships, constraints and restrictions from the original task data according to the identified task data as shown in Table 3, and store them in the relational database. The principle is to parse the task data in the relational database, obtain the information of overlap relationships, constraints and restrictions through preset rules, and organize the relevant attributes of various constraint information into the database in the form of a structural matrix.
[0075] Table 3 Original task data obtained
[0076] Task Code Task Name start Finish Business-related task code Business Relationship Delay Type Delay A10000 Project team building and project planning 2023 / 10 / 7 8:00 2023 / 10 / 11 17:30 A10001 R&D environment preparation 2023 / 10 / 12 8:30 2023 / 10 / 18 17:30 A10000 Pre A10005 Kick-off meeting 2023 / 10 / 18 17:30 A10001 Pre A10010 Demand research, data collection 2023 / 10 / 19 8:30 2023 / 11 / 1 17:30 A10005 Pre Delay 1 day
[0077] In this embodiment, the task overlap and constraint condition extraction module is specifically:
[0078] Based on the original task data, various types of constraint information are identified, the preceding and following relationships of the tasks are obtained, and the restriction types and restriction conditions of the tasks are read. Task constraint matrix data is constructed based on the constraint information through a structural matrix algorithm, and then task constraint data is identified.
[0079] The predecessor and successor relationships include the predecessor task code and the successor task code; the constraints include the constraint types such as delay, constraint conditions and associated task codes.
[0080] A critical path calculation module is configured to calculate the key tasks and then calculate the critical path through a critical path algorithm based on the overlap relationship, constraint conditions and restriction requirements;
[0081] In this embodiment, the key tasks are obtained by:
[0082] Taking tasks as nodes of a network plan graph, drawing arrows of the network plan graph according to the overlap relationship, drawing weights of the network plan graph according to constraint conditions, and constructing a data model;
[0083] Loading constraints in the data model through a key task algorithm;
[0084] Based on the loaded constraints, the earliest start time and earliest finish time of each task are calculated by forward push method;
[0085] In this embodiment, the earliest start time is calculated as follows:
[0086] The maximum value of the earliest completion time of all predecessor tasks of the current task and the sum of the constraints of type delay.
[0087] The latest start time is calculated as follows:
[0088] The sum of the earliest start time of the current task and the working duration of the current task.
[0089] Based on the loaded constraints, the latest start time and latest completion time of each task are calculated by reverse calculation;
[0090] In this embodiment, the latest completion time is calculated as follows:
[0091] The minimum difference between the latest start time of all subsequent tasks of the current task and the delay constraint.
[0092] The latest start time is calculated as follows:
[0093] The latest finish time of the current task, minus the working duration of the current task.
[0094] Calculate the difference between the latest start time and the earliest start time of each task, and set the task whose difference between the latest start time and the earliest start time is 0 as a critical task.
[0095] In this embodiment, there is also a step of calculating the free time difference, which is the minimum of the earliest start time of all subsequent tasks of the current work task minus the earliest completion time of the current work task.
[0096] In this embodiment, the critical path is obtained by:
[0097] Construct a critical task list according to the overlap relationships, constraints, restriction requirements, parallel tasks of critical tasks, and open tasks of critical tasks;
[0098] According to the time overlapping relationship of each task in the critical task list, one or more critical task paths with the longest time overlapping relationship are selected, and the attributes of the critical task paths are filled to obtain the critical path.
[0099] The planning and scheduling module is configured to complete and display the work plan according to the critical path.
[0100] After completing the work plan scheduling, use graphic display technology to introduce network diagrams, forward lines and other display requirements based on the typical PERT chart and Gantt chart, and combine the hierarchical and classified display requirements of the critical path to create a smart graphic display.
[0101] The main task of the graphic integrated display algorithm is to display the critical path calculation results in a graphical way in the interactive interface. The principle is to use the Neo4j graph database to store more data that is easy to represent connections for graph data, so that the graph rendering engine can retrieve / traverse / navigate more connection data more easily and efficiently, thereby improving application performance. The displayed graphs include network graphs, collapse bars, resource analysis graphs, and progress lines.
[0102] First, set up layers according to display requirements, and realize integrated graphic display by superimposing different layers. Then, for each layer, initialize the rendering object according to the graphic display model, and fill the display data into the rendering object. Secondly, combine the graphics and data, draw and arrange the positions of each task, and finally fill in the colors according to the constraint data and the agreed rules.
[0103] In the interactive interface such as the browser, according to the requirements of graphic display, first introduce and register rendering engines such as Canvas, SVG, WebGL, etc., then load the corresponding renderer, then load the typesetting data and resources, and finally render to achieve graphic display.
[0104] In this embodiment, a risk transmission module is also included, which is configured to obtain the actual progress and completion status of the task in real time according to the work plan scheduling;
[0105] If the actual progress of a task exceeds the set ratio threshold of the work plan scheduling, the task will be recorded as a risk source task;
[0106] Re-enter the data reading module to obtain the current unfinished nuclear engineering plan, and find the second critical path containing the risk source task through the task analysis module, task overlap and constraint condition extraction module and critical path calculation module;
[0107] According to the overdue ratio of the risk source task exceeding the work plan schedule, multiply the time of each task in the second critical path by the overdue ratio to obtain the new expected time of the second critical path;
[0108] Replace the time of all tasks in the second critical path into the current unfinished nuclear engineering plan to obtain a nuclear engineering plan with risk transmission;
[0109] Find the third critical path through the task analysis module, task overlap and constraint extraction module, and critical path calculation module;
[0110] Through the planning and scheduling module, the new work plan is scheduled and displayed according to the third critical path.
[0111] A scheduling method based on a nuclear engineering work plan according to a second embodiment of the present invention comprises:
[0112] Step S1, obtaining a nuclear engineering plan;
[0113] Step S2, extracting original task data from the nuclear engineering plan;
[0114] Step S3, obtaining the overlapping relationship, constraint conditions and restriction requirements between tasks from the original task data according to preset rules;
[0115] Step S4, based on the overlap relationship, constraint conditions and restriction requirements, calculate the key tasks through a critical path algorithm, and then calculate the critical path;
[0116] Step S5, completing the work plan scheduling according to the critical path and displaying it.
[0117] Although the various steps in the above embodiment are described in the above-mentioned order, those skilled in the art can understand that in order to achieve the effect of this embodiment, different steps do not have to be executed in such an order. They can be executed simultaneously (in parallel) or in a reverse order. These simple changes are within the scope of protection of the present invention.
[0118] It should be noted that the scheduling system based on the nuclear engineering work plan provided in the above embodiment is only illustrated by the division of the above functional modules. In practical applications, the above functions can be assigned to different functional modules as needed, that is, the modules or steps in the embodiments of the present invention can be decomposed or combined. For example, the modules in the above embodiment can be combined into one module, or further divided into multiple sub-modules to complete all or part of the functions described above. The names of the modules and steps involved in the embodiments of the present invention are only for distinguishing the modules or steps, and are not regarded as improper limitations of the present invention.
[0119] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process and related instructions of the storage device and processing device described above can refer to the corresponding process in the aforementioned method embodiment and will not be repeated here.
[0120] Those skilled in the art should be able to appreciate that the modules and method steps of each example described in conjunction with the embodiments disclosed herein can be implemented with electronic hardware, computer software, or a combination of the two, and the programs corresponding to the software modules and method steps can be placed in random access memory (RAM), memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disks, removable disks, CD-ROMs, or any other form of storage medium known in the technical field. In order to clearly illustrate the interchangeability of electronic hardware and software, the composition and steps of each example have been generally described in the above description according to the function. Whether these functions are performed in electronic hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present invention.
[0121] The terms "first", "second", etc. are used to distinguish similar objects rather than to describe or indicate a particular order or sequence.
[0122] The term "comprise" or any other similar term is intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus / device that includes a list of elements includes not only those elements but also other elements not expressly listed, or also includes elements inherent to such process, method, article, or apparatus / device.
[0123] So far, the technical solutions of the present invention have been described in conjunction with the preferred embodiments shown in the accompanying drawings. However, it is easy for those skilled in the art to understand that the protection scope of the present invention is obviously not limited to these specific embodiments. Without departing from the principle of the present invention, those skilled in the art can make equivalent changes or substitutions to the relevant technical features, and the technical solutions after these changes or substitutions will fall within the protection scope of the present invention.
Claims
1. A scheduling system based on nuclear engineering work plan, characterized in that: The system comprises: a data reading module configured to obtain a nuclear engineering plan; A task parsing module configured to extract raw task data from the nuclear engineering plan; A task overlap and constraint extraction module, configured to obtain the overlap relationship, constraint conditions and restriction requirements between tasks from the original task data according to preset rules; A critical path calculation module is configured to calculate the key tasks and then calculate the critical path through a critical path algorithm based on the overlap relationship, constraint conditions and restriction requirements; The key tasks are selected by constructing a network planning diagram: Taking tasks as nodes of a network plan diagram, drawing arrows of the network plan diagram according to the overlap relationship, drawing weights of the network plan diagram according to constraints, and constructing a data model; loading constraints in the data model through a key task algorithm; calculating the earliest start time and the earliest completion time of each task through a forward method based on the loaded constraints; calculating the latest start time and the latest completion time of each task through a reverse method based on the loaded constraints; calculating the difference between the latest start time and the earliest start time of each task, and setting the task whose difference between the latest start time and the earliest start time is 0 as a key task; It also includes a risk transmission module configured to obtain the actual progress and completion status of the task in real time according to the work plan scheduling; If the actual progress of a task exceeds the set ratio threshold of the work plan scheduling, the task will be recorded as a risk source task; Re-enter the data reading module to obtain the current unfinished nuclear engineering plan, and find the second critical path containing the risk source task through the task analysis module, task overlap and constraint condition extraction module and critical path calculation module; According to the overdue ratio of the risk source task exceeding the work plan schedule, multiply the time of each task in the second critical path by the overdue ratio to obtain the new expected time of the second critical path; Replace the time of all tasks in the second critical path into the current unfinished nuclear engineering plan to obtain a nuclear engineering plan with risk transmission; Find the third critical path through the task analysis module, task overlap and constraint extraction module, and critical path calculation module; The planning and scheduling module completes and displays the new work plan according to the third critical path.
2. A scheduling system based on nuclear engineering work plan according to claim 1, characterized in that: The task parsing module is specifically: Based on the nuclear engineering plan, extract all task names, hierarchical relationships and overlapping relationships; Based on the task names and hierarchical relationships, constructing tree-like hierarchical data of the nuclear engineering plan through a multi-node tree-like construction algorithm; Based on the tree hierarchy, time attributes and task names are filled into the tasks in the tree hierarchy data in a preset format to obtain original task data.
3. A scheduling system based on nuclear engineering work plan according to claim 1, characterized in that: The task connection and constraint extraction module is specifically: Based on the original task data, various types of constraint information are identified, the preceding and following relationships of the tasks are obtained, and the restriction types and restriction conditions of the tasks are read. Task constraint matrix data is constructed based on the constraint information through a structural matrix algorithm, and then task constraint data is identified.
4. A scheduling system based on nuclear engineering work plan according to claim 3, characterized in that: The earliest start time is calculated as follows: The maximum value of the earliest completion time of all predecessor tasks of the current task and the sum of the constraints of type delay.
5. A scheduling system based on nuclear engineering work plan according to claim 3, characterized in that: The latest start time is calculated as follows: The sum of the earliest start time of the current task and the working duration of the current task.
6. A scheduling system based on nuclear engineering work plan according to claim 3, characterized in that: The latest completion time is calculated as follows: The minimum difference between the latest start time of all subsequent tasks of the current task and the delay constraint.
7. A scheduling system based on nuclear engineering work plan according to claim 3, characterized in that: The latest start time is calculated as follows: The latest finish time of the current task, minus the working duration of the current task.
8. A scheduling system based on nuclear engineering work plan according to claim 3, characterized in that: The critical path is obtained by: Construct a critical task list according to the overlap relationships, constraints, restriction requirements, parallel tasks of critical tasks, and open tasks of critical tasks; According to the time overlapping relationship of each task in the critical task list, one or more critical task paths with the longest time overlapping relationship are selected, and the attributes of the critical task paths are filled to obtain the critical path.
9. A scheduling method based on a nuclear engineering work plan, characterized in that: The method comprises: Step S1, obtaining a nuclear engineering plan; Step S2, extracting original task data from the nuclear engineering plan; Step S3, obtaining the overlapping relationship, constraint conditions and restriction requirements between tasks from the original task data according to preset rules; Step S4, based on the overlap relationship, constraint conditions and restriction requirements, calculate the key tasks through a critical path algorithm, and then calculate the critical path; The key tasks are selected by constructing a network planning diagram: Taking tasks as nodes of a network plan diagram, drawing arrows of the network plan diagram according to the overlap relationship, drawing weights of the network plan diagram according to constraints, and constructing a data model; loading constraints in the data model through a key task algorithm; calculating the earliest start time and the earliest completion time of each task through a forward method based on the loaded constraints; calculating the latest start time and the latest completion time of each task through a reverse method based on the loaded constraints; calculating the difference between the latest start time and the earliest start time of each task, and setting the task whose difference between the latest start time and the earliest start time is 0 as a key task; It also includes obtaining the actual progress and completion status of tasks in real time according to the work plan scheduling; If the actual progress of a task exceeds the set ratio threshold of the work plan scheduling, the task will be recorded as a risk source task; Re-enter the data reading module to obtain the current unfinished nuclear engineering plan, and find the second critical path containing the risk source task through the task analysis module, task overlap and constraint condition extraction module and critical path calculation module; According to the overdue ratio of the risk source task exceeding the work plan schedule, multiply the time of each task in the second critical path by the overdue ratio to obtain the new expected time of the second critical path; Replace the time of all tasks in the second critical path into the current unfinished nuclear engineering plan to obtain a nuclear engineering plan with risk transmission; Find the third critical path; Step S5, completing and displaying a new work plan schedule according to the third critical path.
Citation Information
Patent Citations
Railway construction organization plan automatic laying method and system and storage medium
CN114331067A
Task allocation method and device, terminal equipment and medium
CN117436627A