Research On Multi-Object Robust Resource-Constrained Scheduling Of Project With Uncertainty Duration

With the development of the economy,more and more projects have sprung up.In order to reduce the bankruptcy rate of the project,project management was proposed.After several decades of development,the project management formed a discipline and developed a new branch project scheduling,A multi-objective robust scheduling model for resource-constrained projects and a multi-objective robust scheduling evaluation model for the uncertainty duration resource-constrained project are proposed.The scheduling performs the corresponding optimization.Based on the multi-objective robust scheduling model of resource-constrained projects,this paper proposes a formula that maximizes the solution robustness and minimizes quality robustness and introduces the NSGA-? algorithm,which is specifically used to solve multi-objective problems.The maximization solution robustness formula is based on the division of the project phase.On this basis,the factors related to the project's solution robustness:the total time difference of the project activities,the ratio of the resources required by the project activities to the total resources,and the project phase.The time difference is combined with the start time of the project activity.The larger the value of the solution robustness in the formula indicates that the project scheduling plan is more stable during execution.Minimizing the quality robustness is the shortest completion period of the project.The quality robustness is used to measure the completion period of the project scheduling plan.The shorter the project scheduling completion period is within the specified completion period,indicating the quality of the project scheduling plan is robust.The NSGA-? algorithm is applied in this paper instead of the traditional multi-objective robust scheduling method,which combines the robustness of the solution with the quality robustness by using the manager preference coefficient.The algorithm is an innovation of the genetic algorithm,except for the original genetic algorithm.Some genetics,mutations,etc.also include iast non-dominated sorting algorithms,congestion and elite strategies.The algorithm combines the solution robustness and quality robustness of the project scheduling plan,and uses the random allocation buffer method to obtain the solution robustness and quality robustness of the corresponding project scheduling plan and project scheduling plan.A multi-objective resource-construction robustness scheduling plan of uncertainty duration.which uses Monte Carlo simulation to obtain the actual activity period of the corresponding activity,and evaluates the project scheduling plan through the net present value evaluation function to obtain the net present value of largest project scheduling plan.The net present value evaluation function is based on the project stage and calculates the expenditure and income of the project activity.The penalty cost due to the extension of the project activity needs to be deducted from the income.Therefore,the use of penalty costs can minimize adverse effects,thereby ensuring that the project's net present value remains at a good leveI.Finally,the paper proves the feasibility of the above research methods through the corresponding empirical research,and puts forward relevant suggestions based on the analysis results.