Visual editor-based plan creation and automatic scheduling method

Abstract

The invention relates to a plan creating and automatic scheduling method based on a visual editor, which belongs to the technical field of plan scheduling, and is characterized in that on the basis of preset plan scheduling model parameters, a project is created, a time framework of the project is set, and meanwhile, resource allocation and load limitation are clarified. In a visual editor, plan nodes are added, and plan attributes and dependency relationships are defined in details. The plan scheduling model is combined with project, plan and resource information to automatically generate a scheduling scheme, and the task time sequence is optimized by utilizing an algorithm while the plan execution quality is ensured. According to the method, a visual operation interface is combined with an intelligent algorithm, plan making is promoted to be more efficient, the accuracy and rationality of plan making are greatly improved, and the resource use efficiency is improved.

Description

Technical Field

[0001] The invention relates to a plan creation and automatic scheduling method based on a visual editor, belonging to the technical field of plan scheduling. Background Art

[0002] In the current project management field, reasonable planning and scheduling are important links to ensure efficient use of resources and timely completion of tasks. However, traditional planning and scheduling methods rely heavily on manual experience, which is not only time-consuming and labor-intensive, but also unable to intuitively reflect the overall picture and dynamic changes of project plans. With the development of digital tools, it is very necessary to develop a visual planning and scheduling method. Summary of the invention

[0003] In order to solve the above problems, the present invention discloses a plan creation and automatic scheduling method based on a visual editor, and its specific technical solution is as follows: A plan creation and automatic scheduling method based on a visual editor comprises the following steps: Step 1: Set algorithm parameters according to the scheduling model, including the planning priority weight W and the planning delay penalty coefficient , iteratively calculate the maximum number a of the population; Step 2: Create a project and set the duration, start and end time of the project; Step 3: Define the usage time and load threshold of the resources required for the project plan; Step 4: Add a plan node in the visual editor and define the plan initialization information, which includes the plan priority, plan duration, latest completion time, required resources, lead time, dependency and delay time; Step 5: The trigger system automatically finds the optimal schedule using the schedule model according to the algorithm parameters set in step 1; Step 6: Determine whether the scheduling result meets the requirements. If so, issue it for execution directly. If not, adjust it and issue it for execution.

[0004] Furthermore, the plan priority weight W in step 1 is related to the priority, and different priorities are assigned different weights; Delay Penalty Factor , The maximum number a of the iterative calculation population is defined by the user and is involved in subsequent scheduling calculations. The larger the maximum number a of the iterative calculation population is, the higher the satisfaction of the automatic scheduling is.

[0005] Furthermore, in step 2, the project start and end time are defined by the user and determine the project duration. The end time of the project cannot be earlier than the latest end time of each plan.

[0006] Furthermore, the scheduling model in step 5 automatically finds the optimal scheduling based on the matching degree, and the matching degree is calculated as follows: Step 5.1: Automatically and randomly compile several scheduling methods G according to the project start and end time, resource usage time, resource load critical value, planned duration, planned latest completion time, planned resources, lead time, dependency and delay time information. Each scheduling method is called a calculation population. Step 5.2: Take the extension degree of different priority plans as an important indicator for calculating satisfaction, and get , where W i is the planning priority weight of plan i, C i is the completion time of plan i after scheduling, Di is the preset latest completion time of the plan, calculate the delay degree of each project plan in each scheduling method and summarize it to get , where n is the planned number; Step 5.3: Use the actual load of the planned resources as a reference indicator for the satisfaction calculation, and obtain , where U j is the total usage of resource j, A j is its available capacity; calculate the actual load of each planned resource in each scheduling method and summarize it to obtain , where m is the number of resources; Step 5.4: Take a set of dependent plans and the degree of delay in the planned time as the reference index for calculating the satisfaction, and get , where k represents a set of dependent plans, k1 is the predecessor plan, k2 is the successor plan, S k1 and S k2 are the start times of k1 and k2, respectively, and P k1 is the construction period of the previous plan, λ k is the penalty coefficient for plan delay; when the project contains multiple sets of forward and backward plans, the delay degree of each set of plans is calculated and summarized to obtain ; Step 5.5: According to the plan delay degree, the actual load of resources and the plan delay degree, the satisfaction degree Z1 of the scheduling plan G1 is obtained by summarizing and negating them. The formula is as follows: , Among them, the third summation term Taking the dependency into consideration, the satisfaction degree Z1 of the scheduling plan is finally calculated. The larger the satisfaction degree Z1 is, the more the scheduling plan G1 meets the actual needs; Step 5.6: According to the planning schedule satisfaction formula in step 5.5, calculate the Z values ​​of all scheduling methods in the first round, and select the scheduling method corresponding to the largest Z value as the project planning schedule after system optimization.

[0007] Furthermore, in order to further compress the overall project planning time, increase resource input, and expand the resource usage time, the load critical value remains unchanged. The system automatically and randomly compiles multiple scheduling plans again, and then enters the next iteration. According to the planning schedule satisfaction formula, the Z value of each iteration calculation population under this iteration is calculated and the maximum Z value is retained; After Y iterations, the project schedule with the highest satisfaction level Z is compared and applied.

[0008] The beneficial effects of the present invention are: The present invention optimizes the plan scheduling based on multiple constraints such as time, resources, front and back factors in the project plan, using a set of self-developed algorithm models, and combines it with a user-friendly visual interface to achieve a seamless connection from plan creation to automatic scheduling, greatly improving the efficiency of plan management. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] Figure 1 is a flow chart of the present invention, Figure 2 It is a flow chart of the automatic scheduling algorithm of the present invention. DETAILED DESCRIPTION

[0010] The present invention is further explained below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the following specific embodiments are only used to illustrate the present invention and are not used to limit the scope of the present invention.

[0011] A plan creation and automatic scheduling method based on a visual editor comprises the following steps: Step 1: Set algorithm parameters according to the scheduling model, including the planning priority weight W and the planning delay penalty coefficient , iteratively calculate the maximum population number a.

[0012] The plan priority weight W is related to the priority, and different priorities are assigned different weights. Plan delay penalty coefficient , The maximum number a of the iterative calculation population is defined by the user and is involved in subsequent scheduling calculations. The larger the maximum number a of the iterative calculation population is, the higher the satisfaction of the automatic scheduling is.

[0013] Step 2: Create a project and set its duration, start and end time.

[0014] The project start and end time are defined by the user and determine the project duration. The project end time cannot be earlier than the latest end time of each plan.

[0015] Step 3: Define the time and load thresholds for the resources required for the project plan.

[0016] Step 4: Add a plan node in the visual editor and define the plan initialization information, which includes the plan priority, plan duration, latest completion time, required resources, lead time, dependencies, and delay time.

[0017] Step 5: The user clicks a button to trigger the system to automatically find the optimal schedule based on the algorithm parameters set in step 1 using the schedule model.

[0018] The scheduling model automatically finds the optimal scheduling based on the matching degree. The matching degree calculation process is as follows: Step 5.1: Automatically and randomly compile several scheduling methods G according to the project start and end time, resource usage time, resource load critical value, planned duration, planned latest completion time, planned resources, lead time, dependency and delay time information. Each scheduling method is called a calculation population. Step 5.2: Take any set of scheduling plans G1 and calculate its satisfaction Z1. The scheduling model formula is as follows: ,

[0019] Where n is the number of tasks, W i is the planning priority weight of plan i, C i is the scheduled completion time of plan i, Di is the preset latest completion time of the plan, m is the number of resource types, and U j is the total usage of resource j, A j is its available amount; the third summation term Considering the dependency relationship, k represents a set of dependent plans, k1 is the pre-plan, k2 is the post-plan, S k1 and S k2 are the start times of k1 and k2, respectively, and P k1 is the construction period of the previous plan, λ k is the penalty coefficient for plan delay, and finally the satisfaction degree Z1 of the schedule plan is calculated; Step 5.3: According to the schedule satisfaction formula in step 5.2, calculate the Z values ​​of all scheduling methods, and select the scheduling method corresponding to the largest Z value as the project schedule after system optimization; Step 5.4: In order to further compress the overall project planning time, increase resource input, and expand the resource usage time, the load critical value remains unchanged. The system automatically and randomly compiles multiple scheduling methods again, thus entering the next iteration. According to the scheduling model formula, calculate the Z value of each iteration calculation population under this iteration and retain the maximum Z value; Step 5.5: After Y iterations, compare and apply the scheduling method with the highest satisfaction.

[0020] Step 6: The user determines whether the scheduling result meets the requirements. If so, it is directly issued for execution. If not, it is issued for execution after adjustment.

[0021] Several examples are given below to demonstrate the specific application of the present invention: 1. Project information definition

[0022] 2. Resource information definition

[0023] 3. Planning information definition

[0024] 4. Model parameter setting

[0025] Delay Penalty Factor =0.8 Iteratively calculate the maximum population number a=5 5. Scheduling method and calculation process Scheduling method 1

[0026]

[0027] Scheduling method 2

[0028]

[0029] Scheduling method 3

[0030]

[0031] Scheduling method 4

[0032]

[0033] Scheduling method 5

[0034]

[0035] 6. Results because Therefore, schedule method 3 is selected as the project schedule after system optimization.

[0036] The above is the first round of project scheduling. In order to further compress the overall project planning time, increase resource investment, and expand the resource usage time, the load critical value remains unchanged. The system automatically and randomly compiles multiple scheduling methods again, thus entering the next iteration. According to the scheduling model formula, the Z value of each iteration calculation population under this iteration is calculated and the maximum Z value is retained.

[0037] After Y (Y is the number of user-defined iterations) iterations, the schedule with the highest satisfaction is compared and applied. Of course, the user can also manually modify the schedule in the end.

[0038] It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as generally understood by those skilled in the art to which this application belongs. It should also be understood that terms such as those defined in common dictionaries should be understood to have meanings consistent with the meanings in the context of the prior art, and will not be interpreted with idealized or overly formal meanings unless defined as herein.

[0039] Based on the above ideal embodiments of the present invention, the relevant staff can make various changes and modifications without departing from the technical concept of the present invention through the above description. The technical scope of the present invention is not limited to the contents of the specification, and its technical scope must be determined according to the scope of the claims.

Claims

1. A plan creation and automatic scheduling method based on a visual editor, characterized in that: The following steps are involved: Step 1: Set algorithm parameters according to the scheduling model, including the planning priority weight W and the planning delay penalty coefficient , iteratively calculate the maximum number a of the population; Step 2: Create a project and set the duration, start and end time of the project; Step 3: Define the usage time and load threshold of the resources required for the project plan; Step 4: Add a plan node in the visual editor and define the plan initialization information, which includes the plan priority, plan duration, latest completion time, required resources, lead time, dependency and delay time; Step 5: Trigger the system to automatically generate a project plan based on the algorithm parameters set in step 1 according to the plan initialization information defined by the user, and automatically find the optimal plan schedule based on the preset parameters using the plan scheduling model; Step 6: Determine whether the scheduling result meets the requirements. If so, issue it for execution directly. If not, adjust it and issue it for execution.

2. The method for creating and automatically scheduling a plan based on a visual editor according to claim 1, characterized in that: The plan priority weight W in step 1 is related to the priority, and different priorities are assigned different weights; Delay Penalty Factor , The maximum number a of the iterative calculation population is defined by the user and is involved in subsequent scheduling calculations. The larger the maximum number a of the iterative calculation population is, the higher the satisfaction of the automatic scheduling is.

3. The method for creating a plan and automatically scheduling based on a visual editor according to claim 1, characterized in that: In step 2, the project start and end time are defined by the user and determine the project duration. The end time of the project cannot be earlier than the latest end time of each plan.

4. The method for creating a plan and automatically scheduling based on a visual editor according to claim 1, characterized in that: In step 5, the scheduling model automatically finds the optimal scheduling based on the matching degree, and the matching degree is calculated as follows: Step 5.1: Automatically and randomly compile several scheduling methods G according to the project start and end time, resource usage time, resource load critical value, planned duration, planned latest completion time, planned resources, lead time, dependency and delay time information. Each scheduling method is called a calculation population. Step 5.2: Take the extension degree of different priority plans as an important indicator for calculating satisfaction, and get , where W i is the planning priority weight of plan i, C i is the completion time of plan i after scheduling, Di is the preset latest completion time of the plan, calculate the delay degree of each project plan in each scheduling method and summarize it, and get , where n is the planned number; Step 5.3: Use the actual load of the planned resources as a reference indicator for the satisfaction calculation, and obtain , where U j is the total usage of resource j, A j is its available quantity; Calculate the actual load of each planned resource in each scheduling method and summarize it to get , where m is the number of resources; Step 5.4: Take a set of dependent plans and the degree of delay in the planned time as the reference index for calculating the satisfaction, and get , where k represents a set of dependent plans, k1 is the predecessor plan, k2 is the successor plan, S k1 and S k2 are the start times of k1 and k2, respectively, and P k1 is the construction period of the previous plan, λ k is the penalty coefficient for plan delay; when the project contains multiple sets of forward and backward plans, the delay degree of each set of plans is calculated and summarized to obtain ; Step 5.5: According to the degree of plan delay, the actual load of resources and the degree of plan delay, the satisfaction degree Z1 of the scheduling plan G1 is obtained by summarizing and negating it. The formula is as follows: ， Among them, the third summation term Taking the dependency into consideration, the satisfaction degree Z1 of the scheduling plan is finally calculated. The larger the satisfaction degree Z1 is, the more the scheduling plan G1 meets the actual needs; Step 5.6: According to the planning schedule satisfaction formula in step 5.5, calculate the Z values ​​of all scheduling methods in the first round, and select the scheduling method corresponding to the largest Z value as the project planning schedule after system optimization.

5. The method for creating a plan and automatically scheduling based on a visual editor according to claim 4, characterized in that: In order to further compress the overall project planning time, increase resource input, and expand resource usage time, the load critical value remains unchanged. The system automatically and randomly compiles multiple scheduling plans again, thus entering the next iteration. According to the plan scheduling satisfaction formula, the Z value of each iteration calculation population under this iteration is calculated and the maximum Z value is retained; After Y iterations, the project schedule with the highest satisfaction level Z is compared and applied.

Images