多重作業方式及資源限制下最大淨現值專案排程模式暨求解演算法之研究; Multi-mode resource constrained project scheduling model to maximize net present value and a Solution Algorithm

NCU Institutional Repository > 工學院 > 土木工程研究所 > 博碩士論文 > Item 987654321/47414

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/47414

題名:	多重作業方式及資源限制下最大淨現值專案排程模式暨求解演算法之研究;Multi-mode resource constrained project scheduling model to maximize net present value and a Solution Algorithm
作者:	劉秋蘭;Chiu-lan Liu
貢獻者:	土木工程研究所
關鍵詞:	多重作業方式及資源限制下之專案排程;淨現值;時空網路;含額外限制整數網路流動問題;MRCPSPDCF;net present value;time-space network;integer network flow problem with side constrain
日期:	2011-08-03
上傳時間:	2012-01-05 11:09:58 (UTC+8)
摘要:	在全球化經濟快速發展下，企業為求得生存與發展需更有效地利用有限的資源、盡量縮短專案時間週期及降低作業成本，以求得最大的利潤。然而隨著專案規模的迅速成長，專案排程問題牽涉的相關因素逐漸複雜。雖然過去的專案排程有利用要徑法與計畫評核術進行專案作業排程，但是近幾年來因環境資源匱乏，單憑考量時程的控管而未考量有限的資源，則決策缺乏整體最佳化分析，常非最佳及最有效率之決策。若能將資源限制及不同作業方式等因素加以考量，並建立決策模式，則可望幫助決策者有效地求解此類複雜的專案作業排程。本研究針對多重作業方式及資源限制下最大淨現值專案排程問題，考量現金流量時間價值及相關作業流程與資源限制，利用時空網路流動技巧及數學規劃方法構建一數學模式，以整合有限的資源規劃專案作業排程。此模式為一含額外限制整數網路流動問題，可以利用CPLEX數學規劃軟體求解。為測試本研究模式及演算法的求解績效，本研究以國際測試題庫(PSPLIB)所提供之專案資訊，進行一範例研究，測試結果良好，顯示本研究模式應可為學術及實務業者之參考。 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.
顯示於類別:	[土木工程研究所] 博碩士論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	627	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....