頁籤選單縮合
題 名 | 資源限制下之專案優勢排程方法 |
---|---|
作 者 | 張文貴; 林柏新; | 書刊名 | 管理與系統 |
卷 期 | 2:2 1995.07[民84.07] |
頁 次 | 頁191-203 |
分類號 | 494.542 |
關鍵詞 | 專案管理; 專案排程; 資源衝突; 優勢排程; 啟發式演算法; Project management; Project scheduling; Resource conflicts; Dominance technique; Heuristic algorithm; |
語 文 | 中文(Chinese) |
中文摘要 | 在資源限制下之專案排程,有些啟發式方法,採用優先權之分派法則; 但在實際的排程應用中,此等法則所排出的最後結果,卻常與最佳解有很大的差 異。因此,本文在研究Hasting之優勢排程理論後,提出一套啟發式演算法,能結 合如最遲開始時間之優先權分派法則,期使本啟發式方法更能適用於真實的排程 狀況。 為比較分析,本文之啟發式方法曾用Panerson之110問題集進行測試;結果顯示, 本研究提出之啟發式演算法,均較最近發表之兩個啟發式方法有顯著的改善,尤 其是在獲得最佳解的機會、誤差之平均值、或誤差之標準差等方面。 |
英文摘要 | In the resource-constramed projects scheduling, some of the heuristic algorithms lie on the priority dispatching rules. However, those rules usually make the final solutions much far away from the optimal solutions, as they are implemented in the real application. Thus, after investigating Hastings's dominance technique, this research develops a new algorithm that combines with the heuristic scheduling priority such as the activity's latest start time rule, in order to make the algorithm more applicable. For comparison, the proposed algorithm is tested with the IIO-problem data set of Fatterson. The result demonstrates a significant improvement over two lately reported heuristic algorithms' results. Inparticular, the proposed algorithm's result is superior in the following cases: reachability of optimal solutions, difference of their mean deviations and standard deviations from the optimal project duration. |
本系統中英文摘要資訊取自各篇刊載內容。