CN111898792A - Method, system and storage medium for determining a project schedule plan - Google Patents

Method, system and storage medium for determining a project schedule plan Download PDF

Info

Publication number
CN111898792A
CN111898792A CN202010507120.6A CN202010507120A CN111898792A CN 111898792 A CN111898792 A CN 111898792A CN 202010507120 A CN202010507120 A CN 202010507120A CN 111898792 A CN111898792 A CN 111898792A
Authority
CN
China
Prior art keywords
input amount
resource input
construction period
path set
planning scheme
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.)
Pending
Application number
CN202010507120.6A
Other languages
Chinese (zh)
Inventor
马华伟
柏文勇
胡笑旋
罗贺
靳鹏
夏维
王国强
唐奕城
圣玉祥
郭君
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hefei University of Technology
Original Assignee
Hefei University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hefei University of Technology filed Critical Hefei University of Technology
Priority to CN202010507120.6A priority Critical patent/CN111898792A/en
Publication of CN111898792A publication Critical patent/CN111898792A/en
Pending legal-status Critical Current

Links

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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Abstract

The embodiment of the invention provides a method, a system and a storage medium for determining a project period planning scheme, belonging to the technical field of control of an automation platform. The method, the system and the storage medium determine the non-critical path set and the critical path set by determining a critical path algorithm, gradually update the duration of the active edges by introducing factors of each active edge, and determine whether the current construction period planning scheme is optimal or not in each update, thereby determining the optimal construction period planning scheme under the condition of avoiding the influence of artificial subjective assumption and accelerating the progress of a project.

Description

Method, system and storage medium for determining a project schedule plan
Technical Field
The invention relates to the technical field of control of automation platforms, in particular to a method, a system and a storage medium for determining a project period planning scheme.
Background
In the manufacturing process of complex products such as aviation, aerospace, ships, automobiles and the like, progress management refers to that a manufacturer comprehensively controls time progress and reasonably allocates resources to achieve overall optimization of the manufacturing process of the products, wherein construction period estimation is an important link of the progress management. Because complex products have the characteristics of high technical content, wide related disciplines, high capital intensity and the like, a product supply system is often presented as a multi-level outsourcing mode of 'main producer-supplier-sub-supplier', namely, the main producer outsources part of manufacturing business to a professional supplier, and the supplier outsourcing part of manufacturing business to a next-level supplier.
In the prior art, each grade of supplier mostly adopts a manual determination mode when determining the own optimal construction period planning scheme, and the determination mode has the characteristics of strong subjectivity and large error. Therefore, in the actual coordination process, the progress of the project is often delayed due to inaccurate construction periods reported by suppliers at each level.
Disclosure of Invention
An object of embodiments of the present invention is to provide a method, a system, and a storage medium for determining a project duration planning scheme, which are capable of accurately determining an optimal project duration planning scheme, thereby advancing the progress of project implementation.
In order to achieve the above object, an embodiment of the present invention provides a method for determining a project period planning scheme, the method including:
determining a critical path set and a non-critical path set of an initial construction period planning scheme by adopting a critical path algorithm;
judging whether the non-critical path set is empty or not;
calculating the factor of each active edge in the non-critical path set according to formula (1) under the condition that the non-critical path set is judged not to be empty,
Figure BDA0002526926290000021
where θ is the factor, tiIs the duration of the ith active edge, λiA constant used for representing the constraint relation between the resource input amount and the duration of the ith active edge;
selecting an active edge with a minimum factor from the non-critical path set;
updating the duration of the selected active edge using equation (2),
t′i＝ti+1， (2)
wherein, ti ′For the updated duration of the ith active edge, tiThe time length of the ith movable edge before updating;
updating the current resource investment amount of the project planning scheme by adopting a formula (3),
S′0＝S0-Δa0， (3)
wherein, S'0For the updated resource input, S0For the resource input before updating, Δ a0The consumption of newly added resources caused by the time length of the selected active edge is updated;
judging whether the updated resource input amount is less than or equal to the actual resource input amount of the construction period planning scheme;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, determining a critical path set and a non-critical path set of the initial construction period planning scheme by adopting a critical path algorithm again, and executing corresponding steps of the method until whether the updated resource input amount is judged to be smaller than or equal to the actual resource input amount of the construction period planning scheme or not is judged;
under the condition that the non-key path set is judged to be empty, calculating the factor of each active edge in the key path set according to the formula (1);
selecting a movable edge with the minimum factor from the key path set;
updating the duration of the selected active edge by adopting the formula (2);
updating the current resource input amount of the construction period planning scheme according to the formula (3);
judging whether the updated resource input amount is less than or equal to the actual resource input amount of the construction period planning scheme;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, selecting the movable edge with the minimum factor from the key path set again, and executing the corresponding steps of the method until whether the updated resource input amount is smaller than or equal to the actual resource input amount of the construction period planning scheme is judged;
and under the condition that the updated resource input amount is judged to be less than or equal to the actual resource input amount of the construction period planning and planning scheme, outputting the current construction period planning scheme as an optimal solution.
Optionally, the method further comprises:
acquiring a production task;
decomposing the production task into a plurality of independent process steps;
creating an initial AOE network graph according to the process, wherein the AOE network graph comprises a plurality of movable edges, each movable edge comprises a plurality of directed edges, the directed edges are used for representing the process of the process activities of the production task, and the vertex of the AOE network graph is used for representing the starting or the ending of each process activity;
constructing a constraint relation between the resource amount of each process operation activity and the completion duration;
increasing the completion duration of each process operation activity to an optimal duration;
and constructing an objective function for estimating the construction period.
Optionally, the objective function is a formula
T′＝minTI， (4)
Wherein T' is the objective function, TIThe start time of the active edge I is, and I is the virtual active edge for finishing.
In another aspect, the present invention also provides a system for determining a project plan, the system comprising a processor configured to:
determining a critical path set and a non-critical path set of an initial construction period planning scheme by adopting a critical path algorithm;
judging whether the non-critical path set is empty or not;
calculating the factor of each active edge in the non-critical path set according to formula (1) under the condition that the non-critical path set is judged not to be empty,
Figure BDA0002526926290000041
where θ is the factor, tiIs the duration of the ith active edge, λiA constant used for representing the constraint relation between the resource input amount and the duration of the ith active edge;
selecting an active edge with a minimum factor from the non-critical path set;
updating the duration of the selected active edge using equation (2),
t′i＝ti+1， (2)
t′ifor the updated duration of the ith active edge, tiThe time length of the ith movable edge before updating;
updating the current resource investment amount of the project planning scheme by adopting a formula (3),
S′0＝S0-Δa0， (3)
wherein, S'0For the updated resource input, S0For the resource input before updating, Δ a0The consumption of newly added resources caused by the time length of the selected active edge is updated;
judging whether the updated resource input amount is less than or equal to the actual resource input amount of the construction period planning scheme;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, determining a critical path set and a non-critical path set of the initial construction period planning scheme by adopting a critical path algorithm again, and executing corresponding steps of the method until whether the updated resource input amount is judged to be smaller than or equal to the actual resource input amount of the construction period planning scheme or not is judged;
under the condition that the non-key path set is judged to be empty, calculating the factor of each active edge in the key path set according to the formula (1);
selecting a movable edge with the minimum factor from the key path set;
updating the duration of the selected active edge by adopting the formula (2);
updating the current resource input amount of the construction period planning scheme according to the formula (3);
judging whether the updated resource input amount is less than or equal to the actual resource input amount of the construction period planning scheme;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, selecting the movable edge with the minimum factor from the key path set again, and executing the corresponding steps of the method until whether the updated resource input amount is smaller than or equal to the actual resource input amount of the construction period planning scheme is judged;
and under the condition that the updated resource input amount is judged to be less than or equal to the actual resource input amount of the construction period planning and planning scheme, outputting the current construction period planning scheme as an optimal solution.
Optionally, the processor is further configured to:
acquiring a production task;
decomposing the production task into a plurality of independent process steps;
creating an initial AOE network graph according to the process, wherein the AOE network graph comprises a plurality of movable edges, each movable edge comprises a plurality of directed edges, the directed edges are used for representing the process of the process activities of the production task, and the vertex of the AOE network graph is used for representing the starting or the ending of each process activity;
constructing a constraint relation between the resource amount of each process operation activity and the completion duration;
increasing the completion duration of each process operation activity to an optimal duration;
and constructing an objective function for estimating the construction period.
Optionally, the objective function is formula (4)
T′＝minTI， (4)
Wherein T' is the objective function, TIThe start time of the active edge I is, and I is the virtual active edge for finishing.
In yet another aspect, the present invention also provides a storage medium storing instructions for reading by a machine to cause the machine to perform a method as claimed in any one of the above.
Through the technical scheme, the method, the system and the storage medium for determining the construction period planning scheme provided by the invention determine the non-critical path set and the critical path set through determining the critical path algorithm, gradually update the duration of the active edges by introducing the factor of each active edge, and determine whether the current construction period planning scheme is optimal or not during each update, so that the optimal construction period planning scheme is determined under the condition of avoiding the influence of artificial subjective assumption, and the progress of a project is accelerated.
Additional features and advantages of embodiments of the invention will be set forth in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the embodiments of the invention without limiting the embodiments of the invention. In the drawings:
FIG. 1 is a flow diagram of a method for determining a project plan, according to one embodiment of the invention;
FIG. 2 is a flow diagram of a method of generating an initial project schedule plan, according to one embodiment of the present invention; and
FIG. 3 is a schematic diagram of an AOE network diagram according to one embodiment of the present invention.
Detailed Description
The following detailed description of embodiments of the invention refers to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating embodiments of the invention, are given by way of illustration and explanation only, not limitation.
In the embodiments of the present invention, unless otherwise specified, the use of directional terms such as "upper, lower, top, and bottom" is generally used with respect to the orientation shown in the drawings or the positional relationship of the components with respect to each other in the vertical, or gravitational direction.
In addition, if there is a description of "first", "second", etc. in the embodiments of the present invention, the description of "first", "second", etc. is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between the various embodiments can be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, the combination of the technical solutions should be considered to be absent and not be within the protection scope of the present invention.
Fig. 1 is a flow chart illustrating a method for determining a project plan according to an embodiment of the present invention. In fig. 1, the method may include:
in step S10, a critical path algorithm is used to determine a critical path set and a non-critical path set of the initial project plan.
In step S11, it is determined whether the non-critical path set is empty;
in step S12, in the case where it is determined that the non-critical path set is not empty, a factor of each active edge in the non-critical path set is calculated according to formula (1),
Figure BDA0002526926290000071
where θ is a factor, tiIs the duration of the ith active edge, λiA constant used for representing the constraint relation between the resource input amount and the duration of the ith active edge;
in step S13, selecting the least factorial active edge from the set of non-critical paths;
in step S14, the duration of the selected active edge is updated using equation (2),
t′i＝ti+1， (2)
wherein, t'iFor the updated duration of the ith active edge, tiThe time length of the ith movable edge before updating;
in step S15, the resource input amount of the current schedule planning plan is updated using the formula (3),
S′0＝S0-Δa0， (3)
wherein, S'0For updated resource input, S0For resource input before update, Δ a0The consumption of newly added resources caused by the time length of the selected active edge is updated;
in step S16, it is determined whether the updated resource investment amount is less than or equal to the actual resource investment amount of the project planning plan;
and under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, determining the key path set and the non-key path set of the initial construction period planning scheme by adopting the key path algorithm again, and executing corresponding steps of the method until whether the updated resource input amount is smaller than or equal to the actual resource input amount of the construction period planning scheme is judged.
In step S17, under the condition that the non-critical path set is judged to be empty, calculating a factor of each active edge in the critical path set according to formula (1);
in step S18, selecting a moving edge with the smallest factor from the set of critical paths;
in step S19, updating the duration of the selected active edge using formula (2);
in step S20, the resource input amount of the current schedule planning plan is updated according to the formula (3);
in step S21, it is determined whether the updated resource investment amount is less than or equal to the actual resource investment amount of the project planning plan;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, selecting the movable edge with the minimum factor from the key path set again, and executing the corresponding steps of the method until whether the updated resource input amount is smaller than or equal to the actual resource input amount of the construction period planning scheme is judged;
in step S22, when it is determined that the updated amount of input resources is equal to or less than the actual amount of input resources of the project plan, the current project plan is output as the optimal solution.
In one embodiment of the present invention, the initial schedule planning scheme may be obtained by the method shown in fig. 2. In fig. 2, the method may further include:
in step S20, a production task is acquired;
in step S21, the production task is broken down into a plurality of independent process steps;
in step S22, an initial AOE network map is created according to the process sequence. Wherein, the AOE network graph can comprise a plurality of active edges, each active edge comprises a plurality of directed edges, the directed edges are used for representing the process of the process operation activity of the production task, and the vertex of the AOE network graph is used for representing the start or the end of each process operation activity. In particular, the AOE network graph may be of the form shown in fig. 3.
In step S23, a constraint relationship between the resource amount and the completion duration of each process operation activity is constructed;
in step S24, the completion time length of each process operation activity is increased to the optimum time length;
in step S25, an objective function for estimating the period is constructed. Specifically, the objective function may be formula (4)
T′＝minTI， (4)
Wherein T' is an objective function, TIThe start time of the active edge I is, and I is the virtual active edge for finishing.
In another aspect, the present disclosure also provides a system for determining a project plan, which may include a processor that may be configured to perform a method as illustrated in fig. 1 or fig. 2.
In yet another aspect, the present invention also provides a storage medium which may store instructions which are readable by a machine to cause the machine to perform a method as described in any one of the above.
Through the technical scheme, the method, the system and the storage medium for determining the construction period planning scheme provided by the invention determine the non-critical path set and the critical path set through determining the critical path algorithm, gradually update the duration of the active edges by introducing the factor of each active edge, and determine whether the current construction period planning scheme is optimal or not during each update, so that the optimal construction period planning scheme is determined under the condition of avoiding the influence of artificial subjective assumption, and the progress of a project is accelerated.
Although the embodiments of the present invention have been described in detail with reference to the accompanying drawings, the embodiments of the present invention are not limited to the details of the above embodiments, and various simple modifications can be made to the technical solution of the embodiments of the present invention within the technical idea of the embodiments of the present invention, and the simple modifications all belong to the protection scope of the embodiments of the present invention.
It should be noted that the various features described in the above embodiments may be combined in any suitable manner without departing from the scope of the invention. In order to avoid unnecessary repetition, the embodiments of the present invention will not be described separately for the various possible combinations.
Those skilled in the art can understand that all or part of the steps in the method for implementing the above embodiments may be implemented by a program to instruct related hardware, where the program is stored in a storage medium and includes several instructions to enable a (may be a single chip, a chip, etc.) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In addition, various different embodiments of the present invention may be arbitrarily combined with each other, and the embodiments of the present invention should be considered as disclosed in the disclosure of the embodiments of the present invention as long as the embodiments do not depart from the spirit of the embodiments of the present invention.

Claims (7)

1. A method for determining a project plan, the method comprising:
determining a critical path set and a non-critical path set of an initial construction period planning scheme by adopting a critical path algorithm;
judging whether the non-critical path set is empty or not;
calculating the factor of each active edge in the non-critical path set according to formula (1) under the condition that the non-critical path set is judged not to be empty,
Figure FDA0002526926280000011
where θ is the factor, tiIs the duration of the ith active edge, λiA constant used for representing the constraint relation between the resource investment and the duration of the ith active edge;
selecting an active edge with a minimum factor from the non-critical path set;
updating the duration of the selected active edge using equation (2),
t′i＝ti+1， (2)
wherein, t'iFor the updated duration of the ith active edge, tiThe time length of the ith movable edge before updating;
updating the current resource amount investment of the project time planning scheme by adopting the formula (3),
S′0＝S0-Δa0， (3)
wherein, S'0For the updated resource input, S0For the resource input before updating, Δ a0The consumption of newly added resources caused by the time length of the selected active edge is updated;
judging whether the updated resource input amount is less than or equal to the actual resource input amount of the construction period planning scheme;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, determining a critical path set and a non-critical path set of the initial construction period planning scheme by adopting a critical path algorithm again, and executing corresponding steps of the method until whether the updated resource input amount is judged to be smaller than or equal to the actual resource input amount of the construction period planning scheme or not is judged;
under the condition that the non-key path set is judged to be empty, calculating the factor of each active edge in the key path set according to the formula (1);
selecting a movable edge with the minimum factor from the key path set;
updating the duration of the selected active edge by adopting the formula (2);
updating the current resource input amount of the construction period planning scheme according to the formula (3);
judging whether the updated resource input amount is less than or equal to the actual resource input amount of the construction period planning scheme;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, selecting the movable edge with the minimum factor from the key path set again, and executing the corresponding steps of the method until whether the updated resource input amount is smaller than or equal to the actual resource input amount of the construction period planning scheme is judged;
and under the condition that the updated resource input amount is judged to be less than or equal to the actual resource input amount of the construction period planning and planning scheme, outputting the current construction period planning scheme as an optimal solution.
2. The method of claim 1, further comprising:
acquiring a production task;
decomposing the production task into a plurality of independent process steps;
creating an initial AOE network graph according to the process, wherein the AOE network graph comprises a plurality of movable edges, each movable edge comprises a plurality of directed edges, the directed edges are used for representing the process of the process activities of the production task, and the vertex of the AOE network graph is used for representing the starting or the ending of each process activity;
constructing a constraint relation between the resource amount of each process operation activity and the completion duration;
increasing the completion duration of each process operation activity to an optimal duration;
and constructing an objective function for estimating the construction period.
3. The method of claim 2, wherein the objective function is equation (4),
T′＝minTI， (4)
wherein T' is the objective function, TIThe start time of the active edge I is, and I is the virtual active edge for finishing.
4. A system for determining a project plan, the system comprising a processor configured to:
determining a critical path set and a non-critical path set of an initial construction period planning scheme by adopting a critical path algorithm;
judging whether the non-critical path set is empty or not;
calculating the factor of each active edge in the non-critical path set according to formula (1) under the condition that the non-critical path set is judged not to be empty,
Figure FDA0002526926280000031
where θ is the factor, tiIs the duration of the ith active edge, λiA constant used for representing the constraint relation between the resource input amount and the duration of the ith active edge;
selecting an active edge with a minimum factor from the non-critical path set;
updating the duration of the selected active edge using equation (2),
t′i＝ti+1， (2)
t′ifor the updated duration of the ith active edge, tiThe time length of the ith movable edge before updating;
updating the current resource investment amount of the project planning scheme by adopting a formula (3),
S′0＝S0-Δa0， (3)
wherein, S'0For the updated resource input, S0For the resource input before updating, Δ a0For newly adding resources due to updating of the duration of the selected active edgeConsumption;
judging whether the updated resource input amount is less than or equal to the actual resource input amount of the construction period planning scheme;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, determining a critical path set and a non-critical path set of the initial construction period planning scheme by adopting a critical path algorithm again, and executing corresponding steps of the method until whether the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme or not is judged;
under the condition that the non-key path set is judged to be empty, calculating the factor of each active edge in the key path set according to the formula (1);
selecting a movable edge with the minimum factor from the key path set;
updating the duration of the selected active edge by adopting the formula (2);
updating the current resource input amount of the construction period planning scheme according to the formula (3);
judging whether the updated resource input amount is less than or equal to the actual resource input amount of the construction period planning scheme;
under the condition that the updated resource input amount is judged to be larger than the actual resource input amount of the construction period planning scheme, selecting the movable edge with the minimum factor from the key path set again, and executing the corresponding steps of the method until whether the updated resource input amount is smaller than or equal to the actual resource input amount of the construction period planning scheme is judged;
and under the condition that the updated resource input amount is judged to be less than or equal to the actual resource input amount of the construction period planning and planning scheme, outputting the current construction period planning scheme as an optimal solution.
5. The system of claim 4, wherein the processor is further configured to:
acquiring a production task;
decomposing the production task into a plurality of independent process steps;
creating an initial AOE network graph according to the process, wherein the AOE network graph comprises a plurality of movable edges, each movable edge comprises a plurality of directed edges, the directed edges are used for representing the process of the process activities of the production task, and the vertex of the AOE network graph is used for representing the starting or the ending of each process activity;
constructing a constraint relation between the resource amount of each process operation activity and the completion duration;
increasing the completion duration of each process operation activity to an optimal duration;
and constructing an objective function for estimating the construction period.
6. The system of claim 5, wherein the objective function is formula (4)
T′＝minTI， (4)
Wherein T' is the objective function, TIThe start time of the active edge I is, and I is the virtual active edge for finishing.
7. A storage medium storing instructions for reading by a machine to cause the machine to perform a method according to any one of claims 1 to 3.
CN202010507120.6A 2020-06-05 2020-06-05 Method, system and storage medium for determining a project schedule plan Pending CN111898792A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010507120.6A CN111898792A (en) 2020-06-05 2020-06-05 Method, system and storage medium for determining a project schedule plan

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010507120.6A CN111898792A (en) 2020-06-05 2020-06-05 Method, system and storage medium for determining a project schedule plan

Publications (1)

Publication Number Publication Date
CN111898792A true CN111898792A (en) 2020-11-06

Family

ID=73208010

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010507120.6A Pending CN111898792A (en) 2020-06-05 2020-06-05 Method, system and storage medium for determining a project schedule plan

Country Status (1)

Country Link
CN (1) CN111898792A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5671361A (en) * 1995-09-28 1997-09-23 University Of Central Florida Priority rule search technique for resource constrained project scheduling
CN103761614A (en) * 2014-01-20 2014-04-30 北京仿真中心 Project progress management method based on critical chain
CN106709646A (en) * 2016-12-23 2017-05-24 国网山东省电力公司 Project progress dynamic regulating method considering resource constraint
CN109308586A (en) * 2018-09-30 2019-02-05 南京地铁集团有限公司 The planing method of rail traffic emergency response program based on progress monitoring management

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5671361A (en) * 1995-09-28 1997-09-23 University Of Central Florida Priority rule search technique for resource constrained project scheduling
CN103761614A (en) * 2014-01-20 2014-04-30 北京仿真中心 Project progress management method based on critical chain
CN106709646A (en) * 2016-12-23 2017-05-24 国网山东省电力公司 Project progress dynamic regulating method considering resource constraint
CN109308586A (en) * 2018-09-30 2019-02-05 南京地铁集团有限公司 The planing method of rail traffic emergency response program based on progress monitoring management

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
马华伟等: "多层级外包模式下的复杂产品制造项目工期估算方法", 《项目管理技术》 *

Similar Documents

Publication Publication Date Title
Ranjbar et al. Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
Condotta et al. Tabu search and lower bounds for a combined production–transportation problem
Xie et al. A branch-and-price algorithm for the integrated berth allocation and quay crane assignment problem
JP2010282353A (en) Dynamic maintenance planning apparatus
US7239984B2 (en) Outlier correction
CN111355246A (en) Prediction method, system and storage medium for reactive compensation of phase modulator
CN111898792A (en) Method, system and storage medium for determining a project schedule plan
CN116187738B (en) Automatic generation method of work package based on execution sequence and position distribution
Bartels et al. Scheduling tests in automotive R&D projects using a genetic algorithm
CN111898791A (en) Method and system for determining construction period planning scheme based on multi-level outsourcing mode
CN115600992A (en) Project management method based on prediction algorithm
Maniezzo et al. A heuristic procedure for the multi-mode project scheduling problem based on Benders’ decomposition
CN114581220A (en) Data processing method and device and distributed computing system
JP2002073142A (en) Production schedule generating device and recording medium with recorded production schedule generating program of production schedule generating device
Squillaci et al. Managing complex requests for a constellation of Earth observing satellites
Chaleshtarti et al. Branch and bound algorithms for resource constrained project scheduling problem subject to cumulative resources
CN112433950A (en) Method for automatically building test environment, electronic equipment and storage medium
CN111598511A (en) Method, device and equipment for planning vehicle line for transporting goods and storage medium
US20180060769A1 (en) Computer-implemented product development method
CN111126743B (en) TQCS feature computing method, system and storage medium based on management platform
CN116071003B (en) Material demand plan calculation method, device, electronic equipment and storage medium
US11415970B2 (en) Control planning device, control planning system, control planning method, and recording medium
CN114581221B (en) Distributed computing system and computer device
CN117114742B (en) Method and device for processing production operation data of oil refinery
CN116501653B (en) Software regression testing method and device

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20201106

RJ01 Rejection of invention patent application after publication