Project schedule optimization method for coping with complex timing overlap relationship among tasks

Abstract

The application provides a project schedule optimization method for coping with complex time sequence overlapping relationships among tasks, comprising the following steps: S10, constructing a complex time sequence overlapping double-code network planning graph among tasks in a project; S20, calculating a critical path of the project based on the complex time sequence overlapping double-code network planning graph by using an improved CPM algorithm; wherein the improved CPM algorithm uses the calculated start time, duration and time sequence overlapping relationship of each task to calculate the critical path; and S30, solving by using a task duration time length shortest optimization method on the critical path, a complex time sequence overlapping relationship optimization method among tasks and a dynamic newly added task optimization method meeting the project construction requirements, and completing project schedule optimization. The application improves the critical path acquisition algorithm, simplifies and accelerates the acquisition of the critical path, fully utilizes the flexibility of the task duration on the critical path, the time redundancy amount of the immediately preceding task and the independence of the parallel task, and optimizes the preparation of the project schedule plan.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of project schedule optimization, and particularly relates to a project schedule optimization method for coping with complex time sequence joint relationships between tasks. BACKGROUND

[0002] Traditional project schedule optimization methods mainly consider the constraints of project resources and funds, and mainly focus on theoretical research on multi-task sequencing, conflict management and resource allocation, etc. The methods are mostly based on resource dynamic optimization or resource-constrained scenarios for project schedule management and optimization, and such optimization algorithms pay attention to the coordination and mutual constraint relationship between resources.

[0003] However, due to the complexity of project construction technology and numerous constraints, the management information is interlaced and complex, the traditional project schedule optimization method cannot consider various complex time sequence joint relationships between tasks, and is prone to cause omissions in scheduling work.

[0004] In addition, the task acquisition method of the critical path of the project is complicated and has high calculation cost, and it is necessary to calculate the earliest start time, earliest completion time, latest start time and latest completion time of each task, or to repeatedly calculate the duration time of multiple task lines, which is difficult to quickly reveal the key tasks that constrain and affect the entire project advancement, and cannot obtain the expected progress optimization goal, finally leading to project delay and investment failure.

[0005] At the same time, the traditional method defaults that the tasks appearing in the scheduling plan will not be dynamically added, and it is difficult to meet the needs of project planning compilation with new tasks, and lacks progress optimization and control of new tasks. SUMMARY

[0006] The technical problem to be solved by the present application is how to efficiently and reliably realize project schedule optimization, and a project schedule optimization method for coping with complex time sequence joint relationships between tasks is provided.

[0007] The project schedule optimization method for coping with complex time sequence joint relationships between tasks according to the embodiment of the present application comprises:

[0008] S10, constructing a complex time sequence joint double-code network plan graph between tasks in the project;

[0009] S20, calculating the critical path of the project based on the complex time sequence joint double-code network plan graph by using the improved CPM algorithm, wherein the improved CPM algorithm calculates the critical path by using the calculation start time, duration time and time sequence joint relationship of each task;

[0010] S30, the project progress is optimized by the shortest task duration optimization method on the critical path, the complex time sequence overlapping relationship optimization method between tasks and the dynamic new task optimization method meeting the project construction requirements.

[0011] According to some embodiments of the present application, the calculation method of the critical path in step S20 specifically includes:

[0012] S21, the calculation start time and the calculation completion time of each task are calculated based on the complex time sequence overlapping double-code network planning diagram;

[0013] S22, the first task with the earliest calculation start time and the longest task duration is selected as the first task of the critical path by querying from left to right according to the complex time sequence overlapping double-code network planning diagram;

[0014] S23, when the first task of the critical path is completed, it is queried whether there is a task starting and not ending during the execution of the first task, if there is, the task with the longest duration that has started and not ended is selected as the next task of the critical path; if not, the task with the nearest calculation start time and the longest task duration is selected as the next task of the critical path; until the last task with the latest calculation completion time is found, which is the last task on the critical path.

[0015] In some embodiments of the present application, the task duration shortest optimization method on the critical path in step S30 includes:

[0016] S311, each task on the critical path is traversed to determine whether the task duration has flexibility, if it has, the project progress is optimized by compressing the task duration;

[0017] S312, if the task duration does not have flexibility, it is determined whether there is a time redundancy between the task and the previous task, if there is a redundancy, the project progress is optimized by compressing the time redundancy of the previous task;

[0018] S313, it is determined whether the task and the task on the critical path are parallel tasks, if they are parallel tasks, the project progress is optimized by advancing the task duration.

[0019] According to some embodiments of the present application, the optimization method of the complex time sequence overlapping relationship between tasks in step S30 includes:

[0020] The tasks with time sequence overlapping relationship in the project are traversed to determine the type of the time sequence overlapping relationship, and it is determined whether the task planning time of different overlapping types meets the requirements of the corresponding time sequence overlapping relationship, and the corresponding optimization suggestion is given to the task that does not meet the requirements of the corresponding time sequence overlapping relationship.

[0021] In some embodiments of the present application, when there is a new task, in step S30, the optimization method for dynamically adding the task to meet the project construction requirements comprises:

[0022] S321, traversing the newly added task of the project, and determining whether the newly added task is a task on the critical path;

[0023] S322, if the newly added task is a task on the critical path, the project progress is optimized according to the optimization method of the shortest duration of the task on the critical path;

[0024] S323, determining whether the newly added task has a time sequence connection relationship, and if so, the project progress is optimized according to the optimization method of the complex time sequence connection relationship between tasks;

[0025] S324, determining whether the planned completion time of the newly added task is within the project construction cycle, and if not, the planned completion time of the newly added task is optimized and adjusted to be within the project construction cycle.

[0026] According to some embodiments of the present application, in step S321, determining whether the newly added task is a task on the critical path specifically comprises:

[0027] According to the time sequence connection relationship of the newly added task, the calculation start time and the calculation completion time of the new task are calculated;

[0028] The calculation start time of the newly added task is compared and sorted with the calculation start time of the task on the critical path;

[0029] The task on the critical path closest to the calculation start time of the newly added task is selected, and the calculation start time, the calculation completion time and the duration of the new task are calculated according to the improved critical path calculation method from this task, and it is determined whether the calculation start time, the calculation completion time and the duration of the new task meet the requirements of the task selection on the critical path, if they meet the requirements, the new task is added to the critical path, otherwise, the new task is not added.

[0030] In some embodiments of the present application, in step S30, it further comprises: summarizing all project progress optimization suggestions.

[0031] The present application has the following beneficial effects:

[0032] The present application improves the critical path acquisition algorithm according to the critical path generation mechanism of the network planning method, without the need to calculate the earliest start time, the earliest completion time, the latest start time and the latest completion time of each task, and without the need to repeatedly calculate the duration time of multiple task lines, simplifying and accelerating the acquisition of the critical path, fully utilizing the flexibility of the task duration on the critical path, the time redundancy of the immediately preceding task and the independence of the parallel task, and optimizing the preparation of the project progress plan.

[0033] The application introduces the influence of complex time sequence overlap relationship between tasks, establishes a corresponding optimization model, and optimizes the schedule plan with project time sequence overlap relationship through the optimization method of complex time sequence overlap relationship between tasks.

[0034] The application designs an optimization method of dynamically adding tasks to meet the requirements of project construction, speeds up the judgment process of whether the added task is a key task, and solves the demand for dynamically adding tasks in the project construction process. BRIEF DESCRIPTION OF DRAWINGS

[0035] Figure 1 The project schedule optimization method according to the embodiment of the application is shown in the flowchart.

[0036] Figure 2 The complex time sequence overlap relationship according to the embodiment of the application is shown in the diagram.

[0037] Figure 3 The calculation flowchart of the project critical path according to the embodiment of the application is shown.

[0038] Figure 4 The task priority optimization method on the critical path according to the embodiment of the application is shown in the schematic diagram.

[0039] Figure 5 The optimization method of complex time sequence overlap relationship between tasks according to the embodiment of the application is shown in the schematic diagram.

[0040] Figure 6 The optimization method of dynamically adding tasks to meet the requirements of project construction according to the embodiment of the application is shown in the schematic diagram.

[0041] Figure 7 The network plan of a certain software and hardware platform construction according to the embodiment of the application is shown.

[0042] Figure 8 The critical path diagram according to the embodiment of the application is shown.

[0043] Figure 9 The critical path diagram after adding tasks according to the embodiment of the application is shown. DETAILED DESCRIPTION

[0044] In order to further illustrate the technical means and effects taken by the application to achieve the predetermined purpose, the application will be described in detail below in combination with the drawings and preferred embodiments.

[0045] The description of the method flow in the specification of the application and the steps of the flowchart in the drawings of the application do not have to be strictly executed according to the step numbers. The method steps can change the execution order. Moreover, some steps can be omitted, a plurality of steps can be combined into one step for execution, and / or one step can be divided into a plurality of steps for execution.

[0046] The application sorts the tasks in the project according to the progress and the time sequence relationship between the tasks, labels the time sequence relationship between the tasks, calculates the critical path of the project by the improved CPM (Critical Path Method) method using the calculation start time, duration and time sequence connection relationship of each task, and calculates the progress redundancy between the tasks on the critical path, so as to establish a progress optimization model of the project, solve the optimization by the shortest optimization method of the task duration on the critical path, the optimization method of the complex time sequence connection relationship between the tasks and the optimization method of the dynamically added task meeting the project construction requirement, and complete the optimization of the project progress in response to the complex time sequence connection relationship between the tasks.

[0047] The application improves the critical path acquisition algorithm according to the critical path generation mechanism of the network planning method, simplifies and accelerates the acquisition of the critical path, fully utilizes the flexibility of the task duration on the critical path, the time redundancy of the task before the critical path and the independence of the parallel task, and optimizes the preparation of the project progress plan.

[0048] The application introduces the influence of the complex time sequence connection relationship between the tasks, establishes the corresponding optimization model, and optimizes the preparation of the project progress plan.

[0049] The application designs a method for quickly judging whether the added task is a critical path task, and solves the optimization demand of the dynamically added task in the project construction process.

[0050] Compared with the traditional project progress optimization method, the application has the following advantages:

[0051] First, the project schedule planning will promptly incorporate the impact of complex time-series relationships between tasks and consider the impact of new tasks on the project schedule design. It will also utilize schedule redundancy between tasks on the critical path and the parallel tasks on non-critical paths. Second, the application of this invention's method will make critical path solving more efficient. It eliminates the need to calculate the earliest start time, earliest finish time, latest start time, and latest finish time of each task, and avoids repeatedly calculating the duration of multiple task paths. It only requires calculating the task's start time and duration, featuring low computational intensity and high adaptability. It can promptly identify and analyze constraints affecting project schedule optimization, significantly improving the efficiency of project schedule optimization.

[0052] The overall flowchart of this invention is as follows: Figure 1 As shown.

[0053] (I) Construction of complex temporal overlapping double-symbol network planning diagram:

[0054] The principle of using a double-code network planning diagram is adopted to directly draw and construct the temporal connection network diagram between tasks in the project.

[0055] (II) Calculation of the project's critical path:

[0056] Because this invention establishes complex temporal connections between tasks, the calculation of the project's critical path will adapt to this relationship while building upon the improved critical path method. The temporal connections are as follows: Figure 2 As shown, the application process includes the following 7 steps, such as... Figure 3 As shown:

[0057] (1) Calculate the computation start time (S) of each task based on the project's time-series network diagram, and the start time S of task j. j The calculation start time depends on its immediate predecessor work i (one or more), as well as the overlap between them and the task duration (D). j The calculation method is as follows:

[0058]

[0059] (2) The computation completion time of task j depends on the computation start time and the task duration (D). j The calculation method is as follows:

[0060] F j =S j +D j ;

[0061] (3) Based on the network plan diagram, search from left to right for the first task i that starts earliest and has the longest duration (start time S is the smallest). This task is the first task on the critical path.

[0062] (4) When this task is completed, check if any tasks started and did not end during the execution of this task (S j <F i And F j >F i If a task exists, the task with the longest duration that has started but not yet ended is selected as the next critical path task; otherwise, the task with the next task whose computation start time is closest to min(|S) is selected. j –S i |)) and the task with the longest duration (max(D) j This is the next key task.

[0063] (5) Calculate the time redundancy between the next task and the previous task. The calculation method is as follows:

[0064] ΔT j =S j计划 -S j计算 ;

[0065] (6) Repeat steps 4-5 until the last task with the latest calculation completion time is found, which is the last critical task on the critical path.

[0066] (7) After completing the critical path search, the final project time is calculated based on the task's computation time.

[0067] ΔT 总 =T maxF -T minS .

[0068] (III) Establishment and solution of the project schedule optimization model:

[0069] The variables of the optimization model of this invention are described in Table 1.

[0070] Table 1. Variable Description for the Optimization Model

[0071] Variable name Variable description i Number of task immediately before j Number of task immediately after Delta T 总 ]] Total duration of tasks on critical path [CAT maxF ]]> Latest finish time of task on critical path [CAT minS ]]> Earliest start time of task on critical path [CAT newF ]]> Finish time of new task F Finish time of task S Start time of task T 计 ]]> Total duration of project plan

[0072] 1. Optimization method for minimizing task duration on the critical path.

[0073] The task optimization method on the critical path includes the following steps, such as... Figure 4 As shown.

[0074] (1) Traverse each task on the critical path, determine whether the task duration has flexibility, if it has, then the optimization effect can be achieved by compressing the task duration, and give the progress optimization suggestion.

[0075] (2) If the task duration does not have flexibility, determine whether the task and the immediately preceding task have time redundancy, if there is redundancy, then the optimization effect can be achieved by compressing the time redundancy of the immediately preceding task, and give the progress optimization suggestion.

[0076] (3) Determine whether the task is a parallel task (a task without time sequence connection relationship), if it is a parallel task, the project efficiency can be improved by advancing the task duration, and give the progress optimization suggestion.

[0077] (4) Continue to repeat (1) ~ (3) to optimize the next task until all tasks on the critical path are traversed.

[0078] (5) Finally, all project progress optimization suggestions with the shortest task duration on the critical path are summarized.

[0079] 2. Optimization method of complex time sequence connection relationship between tasks.

[0080] The optimization method of complex time sequence connection relationship between tasks includes the following steps, as shown in Figure 5 .

[0081] (1) Traverse the tasks with time sequence connection relationship in the project, determine the type of time sequence connection relationship, if it is FTS connection relationship, then proceed to step 2; if it is STS connection relationship, then proceed to step 3; if it is FTF connection relationship, then proceed to step 4; if it is STF connection relationship, then proceed to step 5.

[0082] (2) If the connection relationship is FTS, determine whether the task planned time meets F i ≤S j , if not, then the connection relationship gives optimization suggestion.

[0083] (3) If the connection relationship is STS, determine whether the task planned time meets S i ≤S j , if not, then the connection relationship gives optimization suggestion.

[0084] (4) If the connection relationship is FTF, determine whether the task planned time meets F i ≤F j , if not, then the connection relationship gives optimization suggestion.

[0085] (5) If the connection relationship is STF, determine whether the task planned time meets S j ≤F iIf not, the overlap relationship gives an optimization suggestion.

[0086] (6) Continue to repeat 1-5 to optimize the next time sequence overlap relationship task until all time sequence overlap relationship tasks are completely traversed.

[0087] (7) Finally, all project progress optimization suggestions of the time sequence overlap relationship are summarized.

[0088] 3. Dynamic addition of tasks to meet the optimization method of project construction requirements.

[0089] The optimization method of dynamic addition of tasks to meet the requirements of project construction in the process of project construction includes the following steps, as shown in Figure 6 .

[0090] (1) Traverse the newly added tasks of the project, and judge whether the task is a task on the critical path.

[0091] (2) In the judgment, first calculate the calculation start time of the new task according to the time sequence overlap relationship of the new task.

[0092] (3) Compare and sort the calculation start time of the new task with the calculation start time of the task on the critical path, and then select the task on the critical path that is closest to the start time of the new task (min(|S new -S i |)). From this task, the calculation method of the improved critical path in the present application is calculated to judge whether the calculation start time and duration of the new task meet the requirements of the selected critical path task. If it meets the requirements, it is added to the critical path, otherwise it is not added.

[0093] (4) If the new task is a task on the critical path, proceed to step 5 for optimization; if there is a time sequence overlap relationship, proceed to step 6 for optimization; if the planned completion time of the task is not within the project construction period, proceed to step 7 for optimization;

[0094] (5) If the task is a task on the critical path, optimize it according to the shortest duration optimization method of the task on the critical path.

[0095] (6) If the task has a time sequence overlap relationship, optimize it according to the optimization method of complex time sequence overlap relationship between tasks.

[0096] (7) Determine the range of the project construction period, and if the planned completion time of the task is not within the project construction period (T newF >T 计 ), optimize and adjust the planned completion time of the newly added task within the project construction period.

[0097] (8) Continue to repeat 4-7 optimization of the next new task, until all new tasks are all traversed.

[0098] (9) Finally, all project progress optimization suggestions that meet the project construction requirements of the dynamic new task are summarized.

[0099] The following will take a certain software and hardware platform construction of navigation satellite as an example, and in combination with the drawings, the application will be described in detail. The certain software and hardware platform construction project is divided into 8 work tasks, and the construction period is 150 days. See Table 2.

[0100] Table 2 Task decomposition table

[0101]

[0102] (I) The eight tasks and the time sequence connection relationship between the tasks are drawn and constructed by adopting the double code network plan drawing principle, as shown in Table 1. Figure 7

[0103] (II) The critical path of the project is calculated by using the improved critical path method.

[0104] The calculation start time (S) of each task is calculated:

[0105] Task 1: S1=0;

[0106] Task 2: S2=5;

[0107] Task 3: S3=30;

[0108] Task 4: S4=85;

[0109] Task 5: S5=95;

[0110] Task 6: S6=95;

[0111] Task 7: S7=95;

[0112] Task 8: S8=125;

[0113] The calculation completion time (F) of each task is calculated:

[0114] Task 1: F1=10;

[0115] Task 2: F2=25;

[0116] Task 3: F3=90;

[0117] Task 4: F4=95;

[0118] Task 5: F5=125;

[0119] Task 6: F6=115;​

[0120] Task 7: F7 = 105;

[0121] Task 8: F8 = 145;

[0122] According to the network plan chart, the first task with the earliest calculation start time and the longest task duration is Task 1, which is the first task of the critical path.

[0123] When Task 1 is completed, Task 2 is found to have started and not ended during the execution of Task 1, so Task 2 is the second task of the critical path; in this way, the critical path is Task 1-2-3-4-5-8, as shown in Figure 8 .

[0124] The time redundancy of each task and the preceding task:

[0125] Task 1: ΔT1 = 0-0 = 0;

[0126] Task 2: ΔT2 = 9-5 = 4;

[0127] Task 3: ΔT3 = 30-30 = 0;

[0128] Task 4: ΔT4 = 85-85 = 0;

[0129] Task 5: ΔT5 = 95-95 = 0;

[0130] Task 6: ΔT6 = 95-95 = 0;

[0131] Task 7: ΔT7 = 95-95 = 0;

[0132] Task 8: ΔT8 = 120-125 = -5;

[0133] According to the calculation time of the task, the final time consumption result of the project is obtained:

[0134] ΔT 总 = 145-0 = 145.

[0135] (Three) Establishment and solution of project progress optimization model.

[0136] Optimization method for the duration of tasks on the critical path:

[0137] (1) Traverse each task on the critical path, Task 1 has a certain flexibility, and it is recommended to shorten the task time.

[0138] (2) The time redundancy of Task 2 is ΔT2 = 9-5 = 4, it is recommended to advance the planned start time of Task 2 by 4 days. The time redundancy of Tasks 1, 3, 4, 5, 6, and 7 is 0, and the time redundancy of Task 8 is -5, which does not need to be optimized.

[0139] (3) Task 6, 7 are parallel tasks of task 5, it is suggested to execute as soon as possible.

[0140] (4) Optimization suggestion summary of the shortest duration of tasks on the critical path: task 1 is suggested to shorten the task time; task 2 is suggested to advance the planned start time by 4 days; tasks 6, 7 are suggested to be executed as soon as possible.

[0141] Optimization method of complex timing lap joint relationship between tasks:

[0142] (1) Traverse the tasks with timing lap joint relationship in the project.

[0143] (2) Task 4 and tasks 5, 6, 7 are FTS lap joint relationship, the task planning time meets the requirement of F4≤S 5、6、7 , no optimization is required.

[0144] (3) Task 2 and task 3 are FTS lap joint relationship, the task planning time meets the requirement of F2≤S3, no optimization is required.

[0145] (4) Tasks 5, 6, 7 and task 8 are FTS lap joint relationship, the planned start time of task 8 is less than the end time of task 5, the start time of task 8 needs to be optimized and adjusted.

[0146] (5) Task 1 and task 2 are STS lap joint relationship, the task planning time meets the requirement of S1≤S2, no optimization is required.

[0147] (6) There is no FTF lap joint relationship in the tasks of the project, no optimization is required.

[0148] (7) Task 4 and task 3 are STF lap joint relationship, the task planning time meets the requirement of S4≤F3, meets the requirement, no optimization is required.

[0149] (8) Optimization suggestion summary of complex timing lap joint relationship between tasks: the planned start time of task 8 needs to be optimized.

[0150] (Four) Optimization method of dynamically added tasks meeting the requirements of project construction.

[0151] In the process of construction of the software and hardware platform, the task of "computer room transformation" is temporarily added, and the detailed information is shown in Table 3. The newly added task has FTF lap joint relationship with the previous task, and the LT new = 10.

[0152] Table 3 New task table

[0153]

[0154] (1) Calculate the calculation start time (S) of the newly added task: S new=F5+LT new -D new =125+10-20=115;

[0155] (2) Calculate the calculation completion time (F) of the new task: F new =S new +D new =115+20=135;

[0156] (3) The time redundancy of the new task and the preceding task:

[0157] Task new: Delta T new =115-125=-10;

[0158] (4) The calculation start time of the new task is compared with the calculation start time of the task on the critical path, and the calculation start time and the duration of the new task meet the requirements of the critical path task selection, so the new task is a critical path task, as shown in Figure 9 .

[0159] (5) The redundancy of the new task is -10, and optimization is not required.

[0160] (6) The new task has an FTF overlap relationship, the planned completion time 110<125, and the overlap relationship has a conflict, so the planned start time needs to be optimized and adjusted.

[0161] (7) The planned construction time range of the new task is 90-110, which is within the range of the project construction period (0-150), and optimization is not required.

[0162] (8) The optimization suggestion summary of the dynamic new task meeting the project construction requirements: the planned start time of the new task needs to be optimized and adjusted.

[0163] In summary, the application improves the critical path acquisition algorithm according to the critical path generation mechanism of the network planning method, does not need to calculate the earliest start time, the earliest completion time, the latest start time, the latest completion time of each task, and does not need to repeatedly calculate the duration time of multiple task lines, simplifies and speeds up the acquisition of the critical path, fully utilizes the flexibility of the task duration on the critical path, the time redundancy of the immediately preceding task and the independence of the parallel task, and optimizes the preparation of the project schedule.

[0164] The application introduces the influence of the complex time sequence overlap relationship between tasks, establishes a corresponding optimization model, and optimizes the schedule plan with project time sequence overlap relationship through the optimization method of the complex time sequence overlap relationship between tasks.

[0165] The application designs an optimization method for meeting project construction requirements of dynamic new tasks, speeds up the judgment process of whether the new task is a key task, and solves the demand for dynamic new tasks in the project construction process.

[0166] Through the description of the specific embodiments, the technical means and effects taken by the application to achieve the predetermined purpose can be more deeply and specifically understood. However, the accompanying drawings are only provided for reference and illustration, and are not used to limit the application.

Claims

1. A project schedule optimization method for dealing with complex temporal overlap relationships between tasks, characterized in that, include: S10, construct a complex time-series connection double-code network plan diagram between tasks in the project; S20, based on the complex temporal overlap double-code network plan diagram, the critical path of the project is calculated using the improved CPM algorithm; wherein, the improved CPM algorithm calculates the critical path using the calculation start time, duration and temporal overlap relationship of each task; S30 optimizes project schedule through methods such as minimizing task duration on the critical path, optimizing complex time-series overlaps between tasks, and optimizing dynamically added tasks to meet project construction requirements. In step S30, the optimization methods for minimizing the task duration on the critical path include: S311: Traverse each task on the critical path and determine whether the task duration is flexible. If it is, optimize the project schedule by compressing the task duration. S312 If the task duration is not flexible, determine whether there is a time redundancy between the task and its predecessor. If there is a redundancy, optimize the project schedule by reducing the time redundancy between the task and its predecessor. S313, determine whether the task and the tasks on the critical path are parallel tasks. If they are parallel tasks, optimize the project schedule by advancing the task duration. In step S30, the optimization methods for complex temporal overlap relationships between tasks include: Iterate through the tasks in the project that have temporal overlap relationships, determine the type of temporal overlap relationship, and determine whether the planned time of tasks of different overlap types meets the requirements of the corresponding temporal overlap relationship. Provide corresponding optimization suggestions for tasks that do not meet the requirements of the corresponding temporal overlap relationship. When new tasks are added, the optimization methods in step S30 for dynamically adding tasks to meet project construction requirements include: S321, iterate through the newly added tasks in the project and determine whether the newly added task is a task on the critical path; S322, If the newly added task is a task on the critical path, then the project schedule will be optimized according to the shortest task duration optimization method on the critical path. S323, determine whether there is a time sequence overlap relationship between the newly added tasks. If so, optimize the project schedule according to the optimization method for complex time sequence overlap relationships between tasks. S324, determine whether the planned completion time of the newly added task is within the project construction cycle. If not, optimize and adjust the planned completion time of the newly added task to be within the project construction cycle.

2. The project schedule optimization method for dealing with complex temporal overlap relationships between tasks as described in claim 1, characterized in that, In step S20, the method for calculating the critical path specifically includes: S21, based on the complex temporal overlapping double-code network planning diagram, calculate the calculation start time and calculation completion time of each task; S22, based on the complex time sequence double-code network planning diagram, query from left to right the first task with the earliest calculation start time and the longest task duration, and use it as the first task of the critical path. S23, when the first task of the critical path is completed, query whether there is a task that started and has not ended during the execution of the first task. If there is, select the task that started and has not ended and has the longest duration as the next task of the critical path; if there is no such task, select the task with the most recent calculation start time and the longest duration as the next task of the critical path; until the last task with the latest calculation completion time is found, which is the last task on the critical path.

3. The project schedule optimization method for dealing with complex temporal overlap relationships between tasks according to claim 1, characterized in that, In step S321, determining whether the newly added task is a task on the critical path specifically includes: Calculate the start and completion times of the new tasks based on their temporal overlap. The calculation start time of newly added tasks is compared and sorted with the calculation start times of tasks on the critical path; Select the task on the critical path that is closest to the start time of the new task's calculation. Starting from this task, calculate according to the improved critical path calculation method. Determine whether the start time, completion time, and duration of the new task's calculation meet the requirements for selecting critical path tasks. If they meet the requirements, add it to the critical path; otherwise, do not add it.

4. The project schedule optimization method for dealing with complex temporal overlap relationships between tasks according to claim 1, characterized in that, Step S30 also includes: summarizing and providing all project schedule optimization suggestions.

Images