Research And Development Of Engineering Project Schedule Optimization System Under Multiple Resource Constraints

Multiple resource-constrained project scheduling problem(RCPSP) is a typical and very difficult issue in project scheduling management. As precedence relations and resource constraints must be considered concurrently, this problem is so difficult to solve completely that it belongs to NP-hard in theory. Although the number of project management software is large and its function is powerful at home and abroad,it has many defects in optimization of network plan under multiple resource constraints. The project management software (P3, MS Project, etc.) applied in engineering practice at present adopts approximate optimizing method. The main reasons for causing the situation are that the theory and algorithms of optimization of network plan under multiple resource constraints do not satisfy the demand of reality at present.After reviewing the development history and researching actuality of RCPSP, this dissertation brings forward a new exact algorithm named Branch and Cut procedure (named BAC) which can get the global optimum result of RCPSP. The basic theory and calculating program of BAC is also introduced. Based on BAC algorithm, the optimization system of project network plan under multiple resource constraints is developed by Visual Basic 6.0. With the friendly input and output interface, to input, edit and assign activities and resources could be realized easily. The system can draw Gantt graph, network graph and resource profile with rich information. If the solved problem has many optimum or hypo-optimum results, the system can evaluate those results according to the user's demand, so as to find the best result which satisfies the special demand.The practical effect of the system has been testified and analyzed in chapter 6. The prospect and the further research of this dissertation are given in the end.