Multi-mode resource constrained project scheduling model to maximize net present value and a Solution Algorithm

• Main Authors: Chiu-lan Liu, 劉秋蘭
• Other Authors: Shang-yao Yan
• Format: Others
• Language: zh-TW
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/41665968992215133084

碩士 === 國立中央大學 === 土木工程研究所 === 99 === Due to the fast development of global economy, the enterprises must efficiently use limited resources and essentially reduce the working time period and the operating cost for the project in order to maximize its profit. Because the project size grows rapidly nowadays, these factors involving project scheduling are more and more complex than before. Traditionally, the critical path method (CPM) and the program evaluation and review technique (PERT) were used to formulate the project scheduling. The past time-controlled process for CPM and PERT is neither efficient nor effective from a system perspective, especially due to the short of environment resources recently. A model incorporating the resource-constrained and the different ways of working is expected to help the decision maker to efficiently solve the complicated project scheduling problem. Dealing with the multi-mode resource constrained project scheduling problem with discounted cash flow (MRCPSPDCF), this research adopts the time-space network technique to formulate a mathematical programming model which considers the cash flow value of time and related operating and resource constraints. The mode is formulated as an integer network flow problem with side constraints, which is characterized as NP-hard in terms of optimization. We employ the CPLEX mathematical programming solver, to solve the problem. To evaluate the performance of the proposed model, numerical tests regarding the project scheduling problem library (PSPLIB) are performed. The test results show that the model could be useful references for academics and practicals.