具穩健性與資源可使用成本考慮之雙目標有限資源專案排程

Bi-objective resource-constrained project scheduling with robustness and resource availability cost criteria

鄭如嵐(Ru-Lan Jheng)

指導教授 ： 蔡登茂

國立屏東科技大學/管理學院/工業管理系所/碩士(2010年)

https://doi.org/10.6346/NPUST.2010.00151

摘要

本研究之主要目的乃在專案工期固定之情況下，考慮不可儲存性之資源可使用成本與可儲存資源之相關物料成本下，提出使總專案淨收益及排程穩定度雙目標函數最大化之混合整數非線性規劃模式以及粒子群優法。為驗證本研究所提出的排程法則之績效，本研究也選取現行研究中三個績效優越的啟發式排程法與四種訂購批量法，結合成十二種二階段批量法來進行實驗設計與績效評估分析。研究結果顯示，本研究所提出之粒子群優法的排程績效相當接近最佳解。同時在總專案淨收益與排程穩健度之排程目標下也遠優於其他二階段批量法。本研究所提出的法則可供決策者作為多專案排程問題規劃之重要參考。

關鍵字

資源可使用成本 ； 多目標非線性規劃 ； 穩健排程 ； 資源限制

並列摘要

The main purpose of this study is to explore a bi-objective resource-constrained project scheduling problem with robustness and resource availability cost criteria. We propose a mixed integer nonlinear programming (MINLP) model and a particle swarm optimization (PSO) algorithm to solve the problem. The performance of the proposed PSO algorithm is manifested by comparing it with the MINLP model and the existing rules. The results indicate that the solution obtained by the PSO algorithm is very close to the optimal solution. Moreover, the results indicate that the PSO algorithm is superior to the existing heuristic rules under the performance criteria of the project resource availability cost and the schedule robustness. The approaches proposed in this study can provided project managers with useful tools for making better decisions.

並列關鍵字

resource availability cost ； multi-objective non-linear programming ； robust scheduling ； resource-constrained

參考文獻

1. Blazewicz, J., J. K. Lenstra and A. H. G. Rinnooy Kan, “Scheduling projects to resource constrains: classification and complexity,” Discrete Applied Mathematics, Vol. 5, No.1, pp.11-22, 1983.

2. Boctor, F. F., “Some Efficient Multi-Heuristic Procedures for Resource-constrained Project Scheduling,” European Journal of Operational Research, Vol. 49, No.1, pp.3-13, 1990.

3. Böttcher, J., A. Drexl, R. Kolisch and F. Salewski, “Project scheduling under partially renewable resource constraints”, Management Science, Vol. 45, No. 4, pp.543-559, 1999.

4. Chen P. H. and S. M. Shahandashti, “Hybrid of genetic algorithm and simulated annealing for multiple project scheduling with multiple resource constraints,” Automation in Construction, Vol. 18, No. 4, pp. 434-443, 2009.

5. Chiu, H. N. and D. M. Tsai, “An efficient search procedure for the resource-constrained multi-project scheduling problem with discounted cash flows,” Construction Management and Economics, Vol. 20, No. 1, pp. 55-66, 2002