CN112150011A - Dynamic critical path analysis method and device and electronic equipment - Google Patents
Dynamic critical path analysis method and device and electronic equipment Download PDFInfo
- Publication number
- CN112150011A CN112150011A CN202011027069.5A CN202011027069A CN112150011A CN 112150011 A CN112150011 A CN 112150011A CN 202011027069 A CN202011027069 A CN 202011027069A CN 112150011 A CN112150011 A CN 112150011A
- Authority
- CN
- China
- Prior art keywords
- activity
- time
- target
- activities
- current activity
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004458 analytical method Methods 0.000 title claims abstract description 51
- 230000000694 effects Effects 0.000 claims abstract description 476
- 238000007667 floating Methods 0.000 claims abstract description 98
- 238000000034 method Methods 0.000 claims abstract description 83
- 238000007726 management method Methods 0.000 claims description 100
- 238000004364 calculation method Methods 0.000 claims description 50
- 238000010276 construction Methods 0.000 claims description 13
- 238000003860 storage Methods 0.000 claims description 5
- 230000015556 catabolic process Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 4
- 238000000354 decomposition reaction Methods 0.000 claims description 3
- 230000000737 periodic effect Effects 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 8
- 238000004891 communication Methods 0.000 description 6
- 238000010422 painting Methods 0.000 description 5
- 238000013439 planning Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 230000003111 delayed effect Effects 0.000 description 3
- 238000002360 preparation method Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 238000013213 extrapolation Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000009435 building construction Methods 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
Abstract
The embodiment of the application discloses a dynamic critical path analysis method, a dynamic critical path analysis device and electronic equipment, wherein the method comprises the following steps: determining a plan management objective for which the current analysis is directed; wherein the plan management objective is expressed by a specified activity in the associated network plan; respectively determining a total float time and a target float time of a plurality of activities in the network plan; and determining the activities of which the total floating time is not more than the target floating time or of which the total floating time is not positive as the key activities aiming at the plan management target, and determining the key paths aiming at the plan management target according to the key activities. By the embodiment of the application, different participants of the network plan can be helped to perform the critical path analysis on the target actually required by the participants more individually.
Description
Technical Field
The present application relates to the field of network planning technologies, and in particular, to a dynamic critical path analysis method and apparatus, and an electronic device.
Background
The critical path method is widely applied to various network planning software, including network planning software using a crosswalk diagram as a main display mode, network planning software using a double-code network diagram as a main display mode, planning software in other display modes, and the like. In the planning software, for a certain network plan, a certain critical path and critical activities can be obtained according to the analysis of a critical path method. The critical path method provides important help for project planning management, particularly provides a graphical display for projects and main activities thereof, and the quantitative information provides an extremely important basis for identifying potential project delay risks.
However, the existing critical path method is also insufficient in the practical application of project planning management, and the important point is that the critical path method can only analyze the critical path according to the planned total project time. For example, taking a building construction project as an example, a construction organization plan is a typical network plan, except for the total target of completion delivery, some stage targets often exist in the construction plan, for example, a stage target of a basic construction stage is a main structure plus or minus zero, a main structure construction stage is a structure capping, and the like, and how to identify a critical path for a stage target to help make a specific optimization decision is also a problem often faced by construction managers; for another example, in an engineering construction project, a large number of professional subcontractors often participate, and a specific professional subcontractor is only responsible for the professionally related activities in the project plan, and they often need to identify the critical path of the part of the professional subcontractor responsible for the professionally related activities to help perform effective resource allocation. In these usage scenarios, the traditional critical path method cannot play an effective role.
Disclosure of Invention
The application provides a dynamic critical path analysis method, a dynamic critical path analysis device and electronic equipment, which can help different participants of a network plan to perform critical path analysis on targets actually required by the participants more individually.
The application provides the following scheme:
a dynamic critical path analysis method, comprising:
determining a plan management objective for which the current analysis is directed; wherein the plan management objective is expressed by a specified activity in the associated network plan;
respectively determining a total float time and a target float time of a plurality of activities in the network plan; wherein the target float time is determined according to relevant parameters of activities influenced by the current activity under the plan management goal;
and determining the activities of which the total floating time is not more than the target floating time or of which the total floating time is not positive as the key activities aiming at the plan management target, and determining the key paths aiming at the plan management target according to the key activities.
A dynamic critical path analysis apparatus, comprising:
a plan management target determination unit for determining a plan management target for which the current analysis is directed; wherein the plan management objective is expressed by a specified activity in the associated network plan;
the computing unit is used for respectively determining the total floating time and the target floating time of a plurality of activities in the network plan; wherein the target float time is determined according to relevant parameters of activities influenced by the current activity under the plan management goal;
and the critical activity and path determining unit is used for determining the activities of which the total floating time is not more than the target floating time or of which the total floating time is not positive as the critical activities aiming at the plan management target and determining the critical paths aiming at the plan management target according to the critical activities.
According to the specific embodiments provided herein, the present application discloses the following technical effects:
by the embodiment of the application, a user can specify a specific plan management target according to own requirements, and the target can be expressed by 0 or 1 or more activities in a network plan. In addition, an index of target floating time is added, and the meaning of the target floating time is the maximum value of the total floating time of each activity in the target activity set which can be influenced by the activity. In addition, the judgment mode of the specific key activity is updated. Specifically, when the critical path analysis is performed, the total float time and the target float time corresponding to a plurality of activities in the network plan can be calculated; then, a plurality of activities can be determined, if the total floating time of a certain activity is not greater than the target floating time, or the total floating time is not positive, it means that any delay of the activity will affect the total floating time of at least one target activity, i.e. will affect the set target, and thus, can be determined as a key activity. After a plurality of key activities are determined, a specific key path can be determined according to information such as activity relations immediately before and after the key activities. By the scheme, when the critical path analysis is carried out, not only the total construction period can be used as a target, but also a certain stage activity in the network plan can be used as a target, or a specific plan target which is required to be completed by a certain project participant can be used as a target, and the like. Therefore, the application range of the critical path method is expanded, different participants of the network plan can be helped to perform critical path analysis on the targets actually needed by the participants more individually, and the current work key points of the participants are determined. In addition, the key activities analyzed in the embodiment of the application refer to the floating of at least one target activity in the designated targets, which is influenced by the delayed completion of the activities, so that the definition of the key paths and the key activities has more clear business meanings in management than the definition in the conventional key path method.
Of course, it is not necessary for any product to achieve all of the above-described advantages at the same time for the practice of the present application.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
FIG. 1 is a flow chart of a method provided by an embodiment of the present application;
FIG. 2 is a schematic diagram of a network plan;
FIG. 3 is a schematic diagram of a system provided by an embodiment of the present application;
fig. 4 is a schematic diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments that can be derived from the embodiments given herein by a person of ordinary skill in the art are intended to be within the scope of the present disclosure.
In the embodiment of the present application, it is considered that in a network plan, different management needs may exist at different stages of the plan, and at different stages, due to different targets, corresponding critical activities and critical paths may be different; in addition, different project participants may only need to complete a portion of a particular plan objective in a complete plan, in which case the project participant may only need to be concerned with critical activities and critical paths under the particular plan objective, and so on. However, in the prior art, the critical activities and the critical path analysis can only be performed with the total period of the network plan as a target, and therefore, the above requirements cannot be met.
In view of the above requirements, embodiments of the present application provide corresponding solutions. In this solution, the user may first be allowed to enter a specific plan management goal, which may be expressed by 0 or 1 or more activities in the network plan. That is, in the embodiment of the present application, a user may be allowed to input or select a specific target that needs to perform the critical path analysis, where the target may be a total period target of the entire network plan, or may also target a certain stage activity in the network plan, or a specific plan target that a certain project participant needs to complete, and in addition, may also select 0 activities as a target, and at this time, a specific user may specifically set the target according to an actual requirement as opposed to no specific target.
In addition, the embodiment of the application also provides a concept of the target floating time, and the method specifically calculates parameters of the activity, such as the latest starting time, the latest ending time, the total floating time and the like, and updates the parameters. For each activity in the network plan, the total floating time and the target floating time can be respectively calculated, and finally, the key activity can be determined according to the calculated total floating time and the size relationship between the calculated total floating time and the target floating time, so that the key path can be determined. Wherein the target float time means the maximum value of the total float time of the activity that can be influenced by the activity. Wherein, the activities affected by different activities are different according to different specific situations. For example, if a network plan is associated with a WBS (tree activity breakdown structure of network plan) hierarchy and there are immediate activities in the current activity, the activities affected by the current activity include: a current activity and its target activity belonging to the plan management target among superior parent activities in the WBS, and an immediate activity of the current activity. If a network plan is not associated with a WBS hierarchical relationship, a current activity belongs to the plan management goal, and there is an immediate activity in the current activity, the activities affected by the current activity include: a current activity and an immediate activity of the current activity, and so on. Once the total float time of the activity is not greater than its target float time, or the total float time is not positive, it means that any delay in the activity will affect the total float time of at least one target activity, i.e. will have an effect on the set target, and thus, may be determined as a critical activity. After a plurality of key activities are determined, a specific key path can be determined according to the relationship between key activities and the like.
Specifically, the embodiment of the present application may be applied to various network planning software, and by improving the existing network planning software or developing a completely new network planning software, and implementing the functional module provided by the embodiment of the present application therein, a critical path analysis function facing a stage target or a target that a project participant needs to be responsible for may be provided for a user.
The following provides a detailed description of the embodiments of the present application.
Specifically, the embodiment of the present application provides a dynamic critical path analysis method, and an execution subject of each step of the method may be network planning software. Referring to fig. 1, the method may specifically include:
s101: determining a plan management objective for which the current analysis is directed; wherein the plan management objective is expressed by a specified activity in the associated network plan;
s102: respectively determining a total float time and a target float time of a plurality of activities in the network plan; wherein the target float time is determined according to relevant parameters of activities influenced by the current activity under the plan management goal;
s103: and determining the activities of which the total floating time is not more than the target floating time or of which the total floating time is not positive as the key activities aiming at the plan management target, and determining the key paths aiming at the plan management target according to the key activities.
For ease of understanding, some basic concepts involved in the critical path analysis are described below:
the network plan is composed of activities and relationships between the activities, and the activities can be divided into: move before and after tightening. "i" represents the current activity, then "i-1" represents the activity immediately before "i", and "i + 1" represents the activity immediately after "i".
The immediately preceding activity refers to an activity immediately preceding the activity. The activity cannot begin unless the activity ends immediately before.
Immediate activity refers to the activity immediately following the activity. The activity is not over and cannot begin immediately thereafter.
A particular network plan may describe each activity in a number of ways. For example, the manner of tiling may be included, or, for some relatively complex network plans, the hierarchical relationship between activities may be described by a tree Structure with a parent-child hierarchy, which is generally referred to as Work Breakdown Structure (WBS). The WBS structure generally groups project elements, generalizing and defining the entire work (activity) scope of the project, with each descending layer representing a more detailed definition of the project work (activity), directed toward the deliverables of the project. The root work (activity) in the WBS represents the entire planning activity.
For example, assume that there is a network plan for room painting, containing the activities shown in Table 1:
TABLE 1
| Movement of | Duration DU | Move immediately before |
| A preparation | 2 | - |
| B brush door frame | 2 | A |
| C brush roof | 3 | A |
| D wall painting | 4 | A |
| E second wall pass | 2 | D |
| F end | 2 | B、C、E |
The network diagram can be as shown in fig. 2, and it can be seen that the network plan first needs to complete the activity a, and after the preparation work of the node a is completed, B, C, D activities can be performed in parallel; e activities need to be performed after D activities are completed; B. c, E are all completed, F activity is entered. The specific network diagram structure may be provided in advance by a user such as a whole network plan maker. It should be noted that, in the example shown in fig. 2, there is no WBS hierarchical relationship, and if an "R" node is added before the a node and corresponds to a "room painting" activity, a simple WBS hierarchical relationship may be formed, where the "room painting" activity corresponding to the R node is a root activity, and at this time, the R node also becomes a parent activity of other nodes in the WBS hierarchical relationship.
In addition, the analysis and calculation of the critical path method involves the following concepts:
earliest Start time (ES, earlie Start): refers to the earliest time that an activity can be started, and is determined only by the project plan, and the time that the activity can be started as long as the plan conditions are met.
The Earliest end time (EF, earlie Finish) refers to the Earliest time that a certain activity can be completed.
The Latest end time (LF), refers to the Latest time that an activity must complete.
The Latest Start time (LS), refers to the Latest time at which an activity must Start.
Total Float Time (TF), the time that a schedule activity can be deferred or delayed from the earliest starting date on any network path without delaying the project completion date or violating the schedule constraint, i.e., Total Float time or schedule flexibility.
Duration of activity (DU) refers to the Duration of a certain activity.
The traditional critical path method comprises the following steps of:
1. calculating the earliest time by a forward method: the forward-push method starts from the activity without the activity immediately before, and sequentially calculates the earliest time of the activity from front to back according to the relationship between the activity immediately before and after until all the activities are calculated. ES (ES)i＝max(EFi-1) The earliest starting time of the current activity is the maximum value of the earliest ending time of the work immediately before the current activity; without immediate preceding operation ESi0 or a scheduled start time. Earliest end time EFi＝ESi+DUi。
2. Calculating the latest time by inverse method: the backward-pushing method starts from the activity without the activity immediately after, and sequentially calculates indexes of the activity, such as latest time, total floating time and the like from back to front according to the relationship between the activity immediately before and immediately after until all the activities are calculated. LF (Low frequency)i＝min(LSi+1) That is, the latest end time of the current activity is the minimum of the latest start times of its immediate successors; without working after tightening LFiThe earliest end time of the planned root campaign (i.e., the maximum of the earliest end times of all campaigns), or the planned required completion time. Latest start time LSi＝LFi-DUi(ii) a Total float time TFi＝LFi-EFi＝LSi-ESi。
3. And judging whether the activity is a key activity or not, and determining a key path. The activities with the minimum total floating time or less than or equal to 0 in all activities are key activities, the key activities form a key path, and the key path is also one or more paths with the longest total construction period in the network plan.
In the embodiment of the present application, on the basis of the conventional critical path method, the following is added and improved:
1. before analyzing and calculating the critical path, a step of setting the current management target of the plan is added, so that the user can clearly define the management requirement.
2. The algorithm of calculating the latest time by a backstepping method of a key path method is improved, the influence of a plan target on the latest completion time and the total floating time of calculation work is considered, and new indexes are added: the target float time.
3. The new decision criteria are used to determine the key activities and analyze the key paths for the current target based on the calculations in content 2. Therefore, based on the same network plan, according to different management requirements, the critical path aiming at a specific target can be analyzed, and the requirement of actual management is better met.
In particular implementation, in order to be able to determine the plan management objective for which the current analysis is directed, an operation option for inputting a specific plan management objective may be provided in a user interface of the network planning software, and the user performs the input. The input information may specifically be identification information such as names of some specific activities in the network plan. Or, in another mode, in the case that there is a WBS structure, the WBS structure of the whole network plan may also be displayed, and the nodes included therein are set to be operable states, so that the user may select a plan management target required by the user by selecting one or some of the nodes. This makes it possible for the user to more intuitively complete the setting operation of the plan management target. In the specific implementation, the number of the specific input or selected activities may also be 0, and in this case, it is equivalent to no specific target. Of course, there may be other ways to set the plan management target, for example, whether the attribute is a target or not may be added to the attribute of the activity, the attribute of the target activity may be set (confirmed or cancelled) one by one, and the like.
In addition, the user can also individually set its required end time information in management for each target event, and if not set, the earliest end time of the event is taken as the required end time by default. Specific target activities, that is, activities specifically set as management plan targets.
After the plan management objective is determined, the total float time and the objective float time information of each activity in the network plan can be respectively determined. Specifically, when the target float time is calculated, there may be various ways. For example, one approach may be to calculate the target float times for the plurality of activities in turn using a back-stepping approach; for the current activities, firstly, determining which activities are influenced by the current activities under the current plan management target, and then determining the target floating time according to the relevant parameters (earliest time, latest time and the like) of the activities. Specifically, if the network plan is associated with a WBS hierarchical relationship in a tree activity decomposition structure, and the current activity has an immediate activity, the activities affected by the current activity under the plan management goal include: the current activity and its target activity belonging to the plan management target among all the superior parent activities in the WBS (there may be multiple superior parent activities for a current activity), and the immediate activity of the current activity. At this time, specifically, when determining the target float time of the current activity, the required end time of the current activity may be determined according to the minimum value of the required end time of the target activity, and then the target float time calculation value of the current activity may be determined according to the difference between the required end time of the current activity and the earliest end time; then, the maximum value of the target floating time calculation value of the immediate activity is determined, and then the maximum value is compared with the target floating time calculation value of the current activity, and the larger value is determined as the final result of the target floating time of the current activity.
If the network plan is not associated with a WBS hierarchical relationship, a current activity belongs to the plan management goal, and there is an immediate activity in the current activity, then the activities affected by the current activity under the plan management goal include: the current activity and an immediately subsequent activity to the current activity. At this time, when the target float times of the plurality of activities are sequentially calculated by using a back-stepping method, for a current activity, a target float time calculation value of the current activity may be determined according to a difference between a required end time and an earliest end time of the current activity; then, the maximum value of the target floating time calculation value of the immediately following activity of the current activity is determined, and the maximum value is compared with the target floating time calculation value of the current activity, and the larger value is determined as the final result of the target floating time of the current activity.
Additionally, if a current activity is associated with an associated WBS hierarchy, but the current activity and all its superior parent activities in the WBS do not belong to the plan management target; alternatively, if the network plan is not associated with a WBS hierarchy and the current activity does not belong to the plan management goal, the target float time calculation value for the current activity at that time may be null. At this time, the activities affected by the current activity under the plan management goal may include only: an immediate post activity of the current activity. When the final result of the target floating time of the current activity is determined, the calculation value of the target floating time of the current activity is a null value, so that the calculation value of the target floating time of the immediate post-activity of the current activity does not participate in the calculation any more, and the non-null maximum value of the calculation value of the target floating time of the immediate post-activity of the current activity can be directly determined as the final result of the target floating time of the current activity. Of course, in the case that the calculated value of the target float time of the current activity is null, if there is no immediate activity in the current activity, or all of the calculated values of the target float times of all of the immediate activities are null, then the final result of the target float time of the current activity is null. In addition, when the target float time is empty, the required end time of the current activity is null and it is either not immediately post-active or the target float times of all immediately post-activities are also null, so the latest time (including the latest start time and the latest end time) is null. That is, in the embodiment of the present application, a state of "null value" is allowed to exist (in the conventional critical path method, a state of null value is not allowed to occur at the latest).
For each of the above cases, if there is no immediate activity in the current activity, the target float time calculation value of the current activity may be directly determined as the final result of the target float time of the current activity.
In addition, when determining the total float time, the earliest start time and the earliest end time of the plurality of activities may be calculated sequentially first using a forward-push method (this process may be the same as in the conventional critical path method); then, calculating the latest starting time, the latest ending time and the total floating time of the activities in sequence by utilizing a backward reasoning method; wherein, for a current activity, when determining its latest end time, the minimum value of the latest start time of an activity immediately after the current activity may be determined first, and compared with the required end time of the current activity, and the smaller of the latest start time and the required end time is determined as the latest end time of the current activity; and then determining the latest starting time of the current activity according to the difference between the latest ending time and the construction period of the current activity, and determining the currently obtained total floating time according to the difference between the latest ending time and the earliest ending time. Wherein if the current activity does not have an immediate activity, determining the required end time of the current activity as the latest end time of the current activity.
The required end time of the target activity is determined according to the pre-configured information, and if the information is not configured, the earliest end time of the target activity is determined as the required end time. That is, in the embodiment of the present application, a plan management target for which analysis is directed may be set by a user according to specific needs, and the target may be composed of 0 or 1 to a plurality of activities in a plan, where each target activity may individually set its required end time in management, and if not set, the earliest end time of the activity may be used as the required end time by default. In other words, if a target is a target activity, the required end time of the target activity may be specified by the user, and if the user does not particularly specify the required end time, the theoretical earliest time is used as the required end time.
After the specific total float time and the target float time are determined, the activities of which the total float time is not greater than the target float time or of which the total float time is not positive can be determined as the key activities for the plan management target, and the key paths for the plan management target are determined according to the key activities. During specific implementation, a specific key path can be determined according to information such as activity relationship of key activities in the network plan immediately before and after.
For example, in a specific implementation, assuming that the current network plan is associated with a WBS hierarchical relationship, the specific critical path analysis process provided by the embodiment of the present application may be as follows:
1. determining a plan management goal for which the analysis is directed, the goal may consist of 0 or 1 to a plurality of campaigns in the plan, wherein each target campaign may individually set its required end time on management, and if not, default to the earliest end time of the campaign as the required end time.
2. And sequentially calculating the earliest starting time and the earliest ending time of all activities by a forward-backward method in the critical path method.
3. And calculating the latest starting time, the latest ending time, the total floating time and the target floating time of all the activities in turn by an improved backward extrapolation method.
a) Checking whether the current activity and all its superior parent activities in the WBS are in the target, selecting the qualified target activity set, for example, in the example shown in fig. 2, assuming that the preset target is activity B, C, the current activity is a, since it shows a tiled network plan structure, there is no superior parent node, and the activity a is not the preset target, the target activity set corresponding to the current activity is empty. If the current activity is B, then the target activity set for that activity is { B }, and so on. Required end time RF of a current activityiTarget float time AF ═ the minimum required end time of the target activity in the seti＝RFi-Efi(required end time for Activity i-earliest end time for that Activity i). RFi is null if there is no activity in the set, corresponding AFiNull (null represents no corresponding time value).
b) If the activity has an immediate post-activity, then the time LF is ended at the latesti＝min(LSi+1，RFi) I.e. the latest ending time of an activity is the minimum value of the latest starting time of the activity immediately after the activity, and the latest ending time is compared with the required ending time of the activity calculated in the step a to obtain a small value; AFi＝max(AFi+1，AFi) The target floating time of the activity is the maximum value of the target floating time of the activity immediately after the activity, and the target floating time of the activity calculated in the step a is compared to take a large value; if there is empty value in the above calculation process, the empty value does not participate in the comparison calculation, if there is empty valueAll are null values, the result is also null. If there is no post-tightening activity, LFi＝RFi，AFiRemain unchanged.
c) The latest start time LS of the activityi＝LFi-Dui(latest end time-period), total float time TFi＝LFi-Efi(latest end time-earliest end time) ═ LSi-Esi(latest start time-earliest start time), if the latest time is null, the total float time is null as well
4. And judging whether the activity is a key activity or not, and determining a key path. In the dynamic critical path method, the criterion for critical activity is that the delay of the activity has an effect on the target activity (TF)i<＝AFi) (Total float time)<Target float time) or end Time (TF) that cannot actually meet target requirementsi<0) (total float time)<0), the activity that meets this condition is the key activity, otherwise not, TFiNone of the activities are critical when the value is null.
In order to better understand the technical solution provided by the embodiment of the present application, a network plan and a network diagram shown in fig. 2 are taken as an example, and a comparison between the conventional critical path analysis scheme and the solution provided by the embodiment of the present application is introduced.
First, the results of the analysis and calculation of the network plan by the conventional critical path method are shown in table 2 below:
TABLE 2
Then, an activity for which the total float time is not positive may be determined as a critical activity, that is, specifically, may be: A. d, E, F are provided.
The conventional critical path analysis method can only perform analysis with the total construction period as a target, and therefore, only one analysis result can be given. In the embodiment of the present application, a user may flexibly set a specific analysis management target according to a specific requirement, and the following description is given by way of example in various scenarios.
Scene 1: when F is taken as a target
The technical solution proposed in the embodiments of the present application can be analyzed as follows:
1. the campaign F is set as a target (that is, the critical path analysis may be performed with the total time limit as a target in the embodiment of the present application), and the required end time is not set, and is set as the earliest end time EF of the campaign F by default.
2. The forward method calculates the earliest time, and the results of the activity calculation are recorded in sequence as shown in the following table 3:
TABLE 3
| Movement of | Earliest start time ES | Earliest end time EF |
| A preparation | 0 | 2 |
| B brush door frame | 2 | 4 |
| C brush roof | 2 | 5 |
| D wall painting | 2 | 6 |
| E second wall pass | 6 | 8 |
| F end | 8 | 10 |
3. Calculating the latest time, the total floating time and the target floating time by using an inverse method, and sequentially recording the activity calculation results as shown in the following table 4:
TABLE 4
4. And judging the key activity according to TF < ═ AF or TF < ═ 0, wherein the key activity is A, D, E, F. As can be seen, the scenario is consistent with the results of the traditional critical path method
Scene 2: the target is null
According to the technical scheme provided by the embodiment of the application, the method can be carried out as follows:
1. set the target to null
2. Calculating the earliest time by a forward method, and recording the activity calculation results in sequence, wherein the result is the same as the calculation result of the scene 1 forward method
3. The inverse method calculates the latest time, the total float time and the target float time, and records the calculation results of the activity in turn as shown in the following table 5, wherein "-" represents a null value:
TABLE 5
4. Pressing TF < ═ AF or TF < ═ 0 to judge key activity, and the result is irrelevant key activity
The scenario is without any targets set for planning, which means that planned activities can be postponed indefinitely, so there are no critical activities and critical paths.
Scene 3: target is activity B, C
According to the technical scheme provided by the embodiment of the application, the method can be carried out as follows:
1. the target is set to B, C, where the required end time is set to 5 for campaign B.
2. And (4) calculating the earliest time by a forward method, and recording the activity calculation results in sequence, wherein the result is the same as the calculation result of the forward method in the scene 1.
3. The inverse method calculates the latest time, the total float time and the target float time, and records the calculation results of the activity in turn as shown in the following table 6, wherein "-" represents a null value:
TABLE 6
4. Determining key activity according to TF < ═ AF or TF < ═ 0, wherein the key activity is A, B, C
As can be seen from the comparison, the influence of the project management target on the critical path cannot be well reflected by the conventional critical path method, and the embodiment of the application can enable users such as different managers participating in the plan to propose the personalized management target and perform relevant analysis in a targeted manner.
In addition, the application range of the critical path method is expanded in the embodiment of the present application, and the critical path calculated by the conventional critical path method may become a special case in the embodiment of the present application, that is, the critical path when the root activity (or all activity sets without the activity after the emergency) of the WBS is targeted. The embodiment of the application also allows setting of an empty target, represents no management target requirement, all work can be finished after infinite delay, and parameters of the latest time and the target floating time are all null values. It also allows the user to set different goals for the same share plan based on different administrative needs.
The definition of the critical path and the critical activity in the embodiment of the application has more clear service meanings in management than the definition in the traditional critical path method: a critical activity is a floating time in which delayed completion of its activity affects the activity of at least one of the designated targets. Traditional critical paths and critical activities can only represent factors that affect overall construction.
Moreover, according to the embodiment of the application, different participants of the plan can analyze the critical path and the critical activity which affect the target according to the personalized management target of the participants, and can provide corresponding important indexes such as earliest time, latest time, target floating time, total floating time and the like, so that the users can be helped to effectively optimize the plan for completing the specific target. In the implementation process, different participants of the plan can be helped to more personally identify the current work emphasis of the participants.
It should be noted that the dynamic critical path analysis method provided in the embodiment of the present application may be applied to the simpler network plan in the above example, and may also be applied to a more complex network plan. Such as a lap-joint network plan or other form of network plan, etc. Among them, the lap-joint network plan defines more complex lap-joint relations (there are usually 4 lap-joint relations: completion-start/completion-completion/start-start/start-completion), and the lap-joint relations can set specific advance or delay time (not necessarily 0), etc., which will affect the calculation of the earliest time and the latest time of the activity in the network plan, but still can utilize the solution provided by the embodiment of the present application to perform the analysis of the dynamic critical path. That is, whether it is a simple network plan or a complex network plan, the scheme provided by the embodiment of the present application may be used to perform dynamic setting of plan management targets, calculation of target floating time, determination of key activities, and the like, and the difference is only in calculation of parameters such as earliest time, latest time, and the like of activities in the network plan. For the calculation of each parameter such as the specific earliest time, the latest time, etc. in different network structures, since it is not the focus of the embodiments of the present application and there is no related improvement point, the related descriptions in the prior art can be referred to, and the details are not described here.
Corresponding to the foregoing method embodiment, an embodiment of the present application further provides a dynamic critical path analysis apparatus, and referring to fig. 3, the apparatus may include:
a plan management target determination unit 301 for determining a plan management target for which the current analysis is directed; wherein the plan management objective is expressed by a specified activity in the associated network plan;
a calculating unit 302, configured to determine a total float time and a target float time of a plurality of activities in the network plan respectively; wherein the target float time is determined according to relevant parameters of activities influenced by the current activity under the plan management goal;
a critical activity and path determining unit 303, configured to determine an activity for which the total float time is not greater than the target float time or for which the total float time is not positive as a critical activity for the plan management target, and determine a critical path for the plan management target according to the critical activity.
The plan management target determination unit may be specifically configured to:
an operation option for inputting a plan management objective is provided so that specified activity information is received through the operation option and determined as the plan management objective.
Alternatively, the plan management target determination unit may be specifically configured to:
if the network plan is associated with a WBS hierarchical relationship of a tree activity decomposition structure, presenting the WBS associated with the network plan and setting the nodes in the WBS to be selectable so as to determine the plan management target by receiving the selection operation of the nodes; the WBS hierarchical relationship is used to record a hierarchical relationship between a plurality of activities associated with the network plan.
Wherein, if the network plan is associated with a tree activity breakdown structure (WBS) hierarchical relationship and the current activity has an immediate activity, the activities influenced by the current activity under the plan management goal include:
a current activity and a target activity thereof belonging to the plan management target among superior parent activities in the WBS, and an immediate activity of the current activity;
in this case, the computing unit may be specifically configured to:
sequentially calculating target floating time of the activities by utilizing a reverse-thrust method; for the current activity, determining the required end time of the current activity according to the minimum value of the required end time of the target activity, and then determining a target floating time calculation value of the current activity according to the difference value between the required end time of the current activity and the earliest end time;
and determining the maximum value of the target floating time calculation value of the activity immediately after the current activity, comparing the maximum value with the target floating time calculation value of the current activity, and determining the larger value as the final result of the target floating time of the current activity.
If the network plan is not associated with a WBS hierarchical relationship, a current activity belongs to the plan management goal, and there is an immediate activity in the current activity, then the activities affected by the current activity under the plan management goal include: the current activity and an immediately subsequent activity to the current activity;
in this case, the computing unit may be specifically configured to:
sequentially calculating target floating time of the activities by utilizing a reverse-thrust method; for the current activity, determining a target floating time calculation value of the current activity according to a difference value between the required end time and the earliest end time of the current activity;
and determining the maximum value of the target floating time calculation value of the activity immediately after the current activity, comparing the maximum value with the target floating time calculation value of the current activity, and determining the larger value as the final result of the target floating time of the current activity.
Additionally, the computing unit may be further to: and if the current activity does not have the immediate activity, determining the target floating time calculation value of the current activity as the final result of the target floating time of the current activity.
Further, if the network plan is not associated with a WBS hierarchy and the current activity does not belong to the plan management objective, the final result of the target float time for the current activity is null.
In a specific implementation, the apparatus may further include:
a first calculation unit configured to sequentially calculate earliest start times and earliest end times of the plurality of activities by using a forward-push method;
a second calculation unit for calculating the latest start time, the latest end time and the total floating time of the plurality of activities in sequence by using a backward extrapolation method;
wherein, for the current activity, the second computing unit may be specifically configured to: when determining the latest end time of the current activity, determining the minimum value of the latest start time of the activity immediately after the current activity, comparing the minimum value with the required end time of the current activity, and determining the smaller value as the latest end time of the current activity; determining the latest starting time of the current activity according to the difference between the latest ending time and the construction period of the current activity, and determining the currently obtained total floating time according to the difference between the latest ending time and the earliest ending time.
Additionally, the second computing unit may be further operable to:
determining a required end time of the current activity as a latest end time of the current activity if the current activity does not have an immediate activity.
And determining the required end time of the target activity according to preconfigured information, if no configuration information exists, defaulting to be a null value, and setting other parameters related to the required end time to be null values.
The plan management goals for which the current analysis is directed may include: a periodic goal in the network plan, or a specific plan goal corresponding to a portion of the network plan for which a particular project participant needs to be responsible.
In addition, the present application also provides a computer-readable storage medium, on which a computer program is stored, where the computer program is characterized in that, when being executed by a processor, the computer program implements the steps of the method in any one of the foregoing method embodiments.
And a computer system comprising:
one or more processors; and
a memory associated with the one or more processors for storing program instructions that, when read and executed by the one or more processors, perform the steps of the method of any of the preceding method embodiments.
Fig. 4 schematically shows an architecture of an electronic device, which may specifically include a processor 410, a video display adapter 411, a disk drive 412, an input/output interface 413, a network interface 414, and a memory 420. The processor 410, the video display adapter 411, the disk drive 412, the input/output interface 413, the network interface 414, and the memory 420 may be communicatively connected by a communication bus 430.
The processor 410 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solution provided by the present Application.
The Memory 420 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, or the like. The memory 420 may store an operating system 421 for controlling the operation of the electronic device 400, a Basic Input Output System (BIOS) for controlling low-level operations of the electronic device 400. In addition, a web browser 423, a data storage management system 424, and a critical path analysis processing system 425, etc., may also be stored. The critical path analysis processing system 425 may be an application program that implements the operations of the foregoing steps in this embodiment. In summary, when the technical solution provided in the present application is implemented by software or firmware, the relevant program code is stored in the memory 420 and called to be executed by the processor 410.
The input/output interface 413 is used for connecting an input/output module to realize information input and output. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The network interface 414 is used to connect a communication module (not shown in the figure) to implement communication interaction between the present device and other devices. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
It should be noted that although the above-mentioned devices only show the processor 410, the video display adapter 411, the disk drive 412, the input/output interface 413, the network interface 414, the memory 420, the bus 430 and so on, in a specific implementation, the device may also include other components necessary for normal operation. Furthermore, it will be understood by those skilled in the art that the apparatus described above may also include only the components necessary to implement the solution of the present application, and not necessarily all of the components shown in the figures.
From the above description of the embodiments, it is clear to those skilled in the art that the present application can be implemented by software plus necessary general hardware platform. Based on such understanding, the technical solutions of the present application may be essentially or partially implemented in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments of the present application.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, the system or system embodiments are substantially similar to the method embodiments and therefore are described in a relatively simple manner, and reference may be made to some of the descriptions of the method embodiments for related points. The above-described system and system embodiments are only illustrative, wherein the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The method, the device and the electronic device for analyzing the dynamic critical path provided by the present application are introduced in detail, and a specific example is applied in the description to explain the principle and the implementation of the present application, and the description of the above embodiment is only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, the specific embodiments and the application range may be changed. In view of the above, the description should not be taken as limiting the application.
Claims (16)
1. A dynamic critical path analysis method, comprising:
determining a plan management objective for which the current analysis is directed; wherein the plan management objective is expressed by a specified activity in the associated network plan;
respectively determining a total float time and a target float time of a plurality of activities in the network plan; wherein the target float time is determined according to relevant parameters of activities influenced by the current activity under the plan management goal;
and determining the activities of which the total floating time is not more than the target floating time or of which the total floating time is not positive as the key activities aiming at the plan management target, and determining the key paths aiming at the plan management target according to the key activities.
2. The method of claim 1,
the determining a plan management objective for which the current analysis is directed includes:
an operation option for inputting a plan management objective is provided so that specified activity information is received through the operation option and determined as the plan management objective.
3. The method of claim 1,
if the network plan is associated with a hierarchical relation of a tree activity decomposition structure (WBS), recording the hierarchical relation among a plurality of activities associated with the network plan; the determining a plan management objective for which the current analysis is directed includes:
and displaying the WBS associated with the network plan, and setting the nodes in the WBS to be selectable, so as to determine the plan management target by receiving the selection operation of the nodes.
4. The method of claim 1,
if the network plan is associated with a tree activity breakdown structure (WBS) hierarchical relationship and the current activity has an immediate activity, the activities influenced by the current activity under the plan management goal comprise:
a current activity and a target activity thereof belonging to the plan management target among all superior parent activities in the WBS, and an immediate activity of the current activity; the WBS is used for recording the hierarchical relation among a plurality of activities associated with the network plan; the determining a total float time and a target float time of a plurality of activities in the network plan respectively includes:
sequentially calculating target floating time of the activities by utilizing a reverse-thrust method; for the current activity, determining the required end time of the current activity according to the minimum value of the required end time of the target activity, and then determining a target floating time calculation value of the current activity according to the difference value between the required end time of the current activity and the earliest end time;
and determining the maximum value of the target floating time calculation value of the activity immediately after the current activity, comparing the maximum value with the target floating time calculation value of the current activity, and determining the larger value as the final result of the target floating time of the current activity.
5. The method of claim 1,
if the network plan is not associated with a WBS hierarchical relationship, a current activity belongs to the plan management goal, and there is an immediate activity in the current activity, then the activities affected by the current activity under the plan management goal include:
the current activity and an immediately subsequent activity to the current activity;
the determining a total float time and a target float time of a plurality of activities in the network plan respectively includes:
sequentially calculating target floating time of the activities by utilizing a reverse-thrust method; for the current activity, determining a target floating time calculation value of the current activity according to a difference value between the required end time and the earliest end time of the current activity;
and determining the maximum value of the target floating time calculation value of the activity immediately after the current activity, comparing the maximum value with the target floating time calculation value of the current activity, and determining the larger value as the final result of the target floating time of the current activity.
6. The method of claim 1,
if a current activity is associated with an associated WBS hierarchy but the current activity and all its superior parent activities in the WBS do not belong to the plan management objective or the network plan is not associated with a WBS hierarchy and the current activity does not belong to the plan management objective, the activities affected by the current activity under the plan management objective include: the current activity is immediately followed by the activity, and the target floating time calculation value of the current activity is a null value;
the determining a total float time and a target float time of a plurality of activities in the network plan respectively includes:
determining a non-null maximum value of the target float time calculation value of the immediately following activity of the current activity as a final result of the target float time of the current activity.
7. The method of claim 6, further comprising:
under the condition that the target floating time calculation value of the current activity is a null value, if the current activity does not have immediate activity or the target floating time calculation values of the immediate activity are both null values, the final result of the target floating time is a null value, and the latest time of the current activity is also a null value.
8. The method of claim 4 or 5, further comprising:
and if the current activity does not have the immediate activity, determining the target floating time calculation value of the current activity as the final result of the target floating time of the current activity.
9. The method of any of claims 4 to 8, further comprising:
sequentially calculating the earliest starting time and the earliest ending time of the plurality of activities by utilizing a forward-push method;
calculating the latest starting time, the latest ending time and the total floating time of the activities in sequence by utilizing a backward pushing method;
when determining the latest end time of the current activity, determining the minimum value of the latest start time of the activity immediately after the current activity, comparing the minimum value with the required end time of the current activity, and determining the smaller value as the latest end time of the current activity;
determining the latest starting time of the current activity according to the difference between the latest ending time and the construction period of the current activity, and determining the currently obtained total floating time according to the difference between the latest ending time and the earliest ending time.
10. The method of claim 9, further comprising:
determining a required end time of the current activity as a latest end time of the current activity if the current activity does not have an immediate activity.
11. The method according to any one of claims 4 to 8,
and determining the required end time of the target activity according to preconfigured information, and if no configuration information exists, determining the earliest end time of the target activity as the required end time.
12. The method according to any one of claims 1 to 8,
plan management goals for which the current analysis is directed include: a periodic goal in the network plan, or a specific plan goal corresponding to a portion of the network plan for which a particular project participant needs to be responsible.
13. The method according to any one of claims 1 to 8,
the plan management goals are expressed by 0 or one or more specified activities in the associated network plan.
14. A dynamic critical path analysis apparatus, comprising:
a plan management target determination unit for determining a plan management target for which the current analysis is directed; wherein the plan management objective is expressed by a specified activity in the associated network plan;
the computing unit is used for respectively determining the total floating time and the target floating time of a plurality of activities in the network plan; wherein the target float time is determined according to relevant parameters of activities influenced by the current activity under the plan management goal;
and the critical activity and path determining unit is used for determining the activities of which the total floating time is not more than the target floating time or of which the total floating time is not positive as the critical activities aiming at the plan management target and determining the critical paths aiming at the plan management target according to the critical activities.
15. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 13.
16. A computer system, comprising:
one or more processors; and
a memory associated with the one or more processors for storing program instructions that, when read and executed by the one or more processors, perform the steps of the method of any of claims 1 to 13.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011027069.5A CN112150011B (en) | 2020-09-25 | 2020-09-25 | Dynamic critical path analysis method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011027069.5A CN112150011B (en) | 2020-09-25 | 2020-09-25 | Dynamic critical path analysis method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112150011A true CN112150011A (en) | 2020-12-29 |
| CN112150011B CN112150011B (en) | 2024-01-26 |
Family
ID=73897451
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011027069.5A Active CN112150011B (en) | 2020-09-25 | 2020-09-25 | Dynamic critical path analysis method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112150011B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130024230A1 (en) * | 2010-08-02 | 2013-01-24 | King Fahd University Of Petroleum And Minerals | Method of extending activity floats in the critical path method |
| US20190130330A1 (en) * | 2017-10-31 | 2019-05-02 | Huntington Ingalls Incorporated | Method and system for management and control of highly complex projects |
| CN111339597A (en) * | 2020-02-28 | 2020-06-26 | 广西华南通信股份有限公司 | Double-code network rapid automatic layout method suitable for information engineering construction project |
| CN111523820A (en) * | 2020-04-30 | 2020-08-11 | 济南森坤企业管理咨询有限公司 | Multi-level block chain technology for organizing, managing and controlling various projects by overall planning method |
| CN111597028A (en) * | 2020-05-19 | 2020-08-28 | 北京百度网讯科技有限公司 | Method and device for task scheduling |
-
2020
- 2020-09-25 CN CN202011027069.5A patent/CN112150011B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130024230A1 (en) * | 2010-08-02 | 2013-01-24 | King Fahd University Of Petroleum And Minerals | Method of extending activity floats in the critical path method |
| US20190130330A1 (en) * | 2017-10-31 | 2019-05-02 | Huntington Ingalls Incorporated | Method and system for management and control of highly complex projects |
| CN111339597A (en) * | 2020-02-28 | 2020-06-26 | 广西华南通信股份有限公司 | Double-code network rapid automatic layout method suitable for information engineering construction project |
| CN111523820A (en) * | 2020-04-30 | 2020-08-11 | 济南森坤企业管理咨询有限公司 | Multi-level block chain technology for organizing, managing and controlling various projects by overall planning method |
| CN111597028A (en) * | 2020-05-19 | 2020-08-28 | 北京百度网讯科技有限公司 | Method and device for task scheduling |
Non-Patent Citations (1)
| Title |
|---|
| 龙健彬: "建筑机电安装工程的施工进度管理研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112150011B (en) | 2024-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP3204063B2 (en) | Schedule management system | |
| US7987110B2 (en) | Managing organizational resources | |
| US8990764B2 (en) | Automated analysis of code developer's profile | |
| US7606750B1 (en) | Method and system for displaying a spending comparison report | |
| US20090055237A1 (en) | System and method for managing inherent project uncertainty | |
| US7743369B1 (en) | Enhanced function point analysis | |
| US8331250B2 (en) | System and method for strategic network planning | |
| US20100017255A1 (en) | Fee estimation tool | |
| US20100198634A1 (en) | Dynamic Calculations in an Employee Compensation System | |
| US20080177526A1 (en) | Computer program, computer apparatus and method for scheduling processes for project progress | |
| Acebes et al. | On the project risk baseline: Integrating aleatory uncertainty into project scheduling | |
| US9082090B2 (en) | System, method, and computer program product for resource collaboration optimization | |
| US7640531B1 (en) | Productivity measurement and management tool | |
| CN112150011A (en) | Dynamic critical path analysis method and device and electronic equipment | |
| CN112016009A (en) | Data processing method, balance obtaining method, device, equipment and storage medium | |
| CN114140033B (en) | Service personnel allocation method and device, electronic equipment and storage medium | |
| US20060074817A1 (en) | Methods and systems for cumulative attribute forecasting using a PDF of a current-to-future value ratio | |
| KR102633857B1 (en) | Work management system that evaluates workers through quantification of work and workplace activities | |
| Czarnacka-Chrobot | Rational pricing of business software systems on the basis of functional size measurement: a case study from Poland | |
| CN115237525A (en) | Employment object determining method, electronic device and storage medium | |
| CN113743791A (en) | Business evaluation method and device for business work order, electronic equipment and medium | |
| CN114416669A (en) | Group process file management method, device, network disk and storage medium | |
| Shimoda et al. | Cost and value analysis of software development method focused on individual function | |
| CN110083438A (en) | Transaction distribution method, apparatus, equipment and storage medium | |
| US11238392B2 (en) | Estimating compensation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |