Research On Optimization Algorithm Of MRCPSP Project Scheduling

The economic globalization has led to today’s competition becoming more and more fiercein our market，and the evolution of modern projects has also became more complex， thusthislead the projects to be with high-quality， short–duration，andlow-cost.The modernproject will not only have time constraints，but also have the resources constraints，it containsnot onlyrenewable resources but also nonrenewable resources. Multi-moderesource-constrained project scheduling problem is a very typical project scheduling problem，which is a kind of NP-hard problem.This kind of multi-mode resource-constrained projectsscheduling problem has already propagated in the engineering industry， the IT industry，manufacturing and other industries.The study of multi-mode resource-constrained project scheduling problem (MRCPSP) canfacilitate the future project managers to learn from this methods， this can not only to extendthe modern project solutions， but can also save resources and money，and this is in line withthe current advocacy resource-saving society construction. Given the multi-moderesource-constrained project scheduling problem has become an important projectmanagement in resource-constrained project scheduling problem， it has not only thetheoretical significance for solving the problem， but also has a very good practice for us tosolve this kind of problem.The main contents of this paper are based on genetic algorithms multi-moderesource-constrained project scheduling problem (MRCPSP) study， the first study is toanalyze the present status at home and abroad， mainly the exact algorithm， heuristicalgorithms and intelligent algorithm for solving resource-constrained project scheduling andknowing the application status of this issues.Then the theory that had associated in this article(mainly comprising: an overview of resource constrained project scheduling problems，theory of constraints theory and genetic algorithm) are discussed in detail and description，especially the introduction of genetic algorithms，asthis article to improve it laid thefoundation.We have assessed scheduling problem of multi-mode resource-constrainedproject (MRCPSP) corresponding algorithm some， analyze its strengths and weaknesses，and then come to this article a conclusion to take advantage of genetic algorithm optimizationof conclusion. After that，we focusedin this article’s portion of the study， establishingMRCPSP mathematical model，and described the model in detail on the genetic algorithmcoding scheme， to improve the fitness function and other aspects， and then applied to actual cases-Rizhao overhaul project scheduling program optimization.Then we use Matlabmathematical calculation and simulation software results based on genetic algorithms， andfinally arrive at a more optimal solution. In order to verify the improved genetic algorithm’sadvantage to solve MRCPSP， we use the traditional method-critical path method to solvethe case accordingly， and the two schemes were analyzed. Based on the systematic analysisof intelligent algorithms-basic genetic algorithm， using the intelligent algorithm to solvethe multi-mode resource constrained project scheduling problems， expanding the geneticalgorithm to solve this kind of problem on MRCPSP range of applications.