【摘要】：現(xiàn)代的項(xiàng)目由于創(chuàng)新性強(qiáng)、規(guī)模巨大、資源需求復(fù)雜、并行程度高,調(diào)度計(jì)劃往往難以如期執(zhí)行。在這種情況下,國(guó)內(nèi)外學(xué)者開始展開資源約束下多項(xiàng)目魯棒調(diào)度的研究,資源約束下多項(xiàng)目魯棒調(diào)度不僅充分考慮資源約束對(duì)項(xiàng)目的影響,還充分考慮了項(xiàng)目在實(shí)際執(zhí)行過程中的各種不確定因素,能夠有效對(duì)抗不確定因素帶來的項(xiàng)目延期風(fēng)險(xiǎn),提高項(xiàng)目完工的質(zhì)量,具有很高的理論研究?jī)r(jià)值和實(shí)際應(yīng)用價(jià)值。 關(guān)鍵鏈項(xiàng)目管理理論自誕生以來,獲得了廣泛應(yīng)用并取得巨大成功,大量實(shí)際應(yīng)用也證明了關(guān)鍵鏈項(xiàng)目調(diào)度能夠在有效縮短項(xiàng)目工期的同時(shí)提高項(xiàng)目的按時(shí)完工率,具備著質(zhì)量魯棒性較好的特點(diǎn)。然而關(guān)鍵鏈項(xiàng)目調(diào)度通過活動(dòng)工期削減,集中設(shè)置緩沖的方法使得項(xiàng)目調(diào)度的工期對(duì)活動(dòng)工期的變化變得不敏感,這也使得單個(gè)活動(dòng)容易超期,進(jìn)而導(dǎo)致其后續(xù)活動(dòng)開始時(shí)間變得不穩(wěn)定,使調(diào)度的解魯棒性變差。針對(duì)這個(gè)問題,本文以魯棒性指標(biāo)最大化和多項(xiàng)目工期最小化,提出了基于關(guān)鍵鏈的多項(xiàng)目魯棒調(diào)度模型。 在求解基于關(guān)鍵鏈的多項(xiàng)目魯棒調(diào)度模型方面,傳統(tǒng)的關(guān)鍵鏈多項(xiàng)目調(diào)度采用各個(gè)項(xiàng)目各自尋找關(guān)鍵鏈,然后交錯(cuò)執(zhí)行規(guī)避瓶頸的辦法,在處理多資源約束的復(fù)雜多項(xiàng)目調(diào)度問題時(shí),這種交錯(cuò)規(guī)避很容易產(chǎn)生新的瓶頸,導(dǎo)致難以生成有效的關(guān)鍵鏈多項(xiàng)目調(diào)度,此外傳統(tǒng)的多項(xiàng)目調(diào)度建立在一定優(yōu)先規(guī)則的基礎(chǔ)上,有限的優(yōu)先規(guī)則不能保證尋求到最優(yōu)解。因此,本文提出一種基于關(guān)鍵鏈的多項(xiàng)目調(diào)度混合優(yōu)化算法,算法分為兩個(gè)模塊,為打破優(yōu)先規(guī)則的局限性,采用遺傳算法尋找項(xiàng)目活動(dòng)的最優(yōu)優(yōu)先權(quán)列表;針對(duì)傳統(tǒng)關(guān)鍵鏈多項(xiàng)目調(diào)度算法難以解決復(fù)雜多資源約束的多項(xiàng)目調(diào)度問題,提出了基于優(yōu)先權(quán)的關(guān)鍵鏈多項(xiàng)目調(diào)度算法,兩個(gè)算法相互結(jié)合,確保得到解的魯棒性和質(zhì)量魯棒性均較優(yōu)的關(guān)鍵鏈調(diào)度方案。隨后本文通過算例驗(yàn)證,并與其他算法進(jìn)行比較,驗(yàn)證了算法的有效性,通過仿真實(shí)驗(yàn)驗(yàn)證了本文提出的魯棒性調(diào)度模型能夠有效提高調(diào)度方案的魯棒性。 最后對(duì)本文工作做出了總結(jié)并提出了進(jìn)一步研究的方向。
[Abstract]:Because of its strong innovation, large scale, complex resource requirements and high degree of parallelism, modern projects are often difficult to execute on schedule. In this case, scholars at home and abroad began to study the multi-project robust scheduling under resource constraints, and the multi-project robust scheduling under resource constraints not only fully considered the impact of resource constraints on the project. It also fully considers all kinds of uncertain factors in the process of project implementation, which can effectively resist the risk of project extension caused by uncertain factors, and improve the quality of project completion. It has high theoretical research value and practical application value. Since the birth of the critical chain project management theory, it has been widely used and achieved great success. A large number of practical applications have also proved that the key chain project scheduling can effectively shorten the project duration and improve the project completion rate on time. It has good quality robustness. However, the key chain project schedule is reduced by the activity duration, and the method of centralizing buffering makes the project schedule less sensitive to the change of the activity duration, which makes it easy for a single activity to overrun. Then the starting time of subsequent activities becomes unstable, and the solution robustness of scheduling becomes worse. Aiming at this problem, a robust scheduling model based on critical chain is proposed in this paper, which is based on robustness maximization and multi-project duration minimization. In solving the multi-project robust scheduling model based on the critical chain, the traditional key chain multi-project scheduling uses each project to find the key chain, and then interlaced to implement the method of avoiding the bottleneck. When dealing with the complex multi-project scheduling problem with multi-resource constraints, this interlaced avoidance is easy to produce new bottlenecks, which makes it difficult to generate effective key chain multi-project scheduling. In addition, the traditional multi-project scheduling is based on certain priority rules, and the finite priority rules can not guarantee the optimal solution. Therefore, this paper proposes a hybrid optimization algorithm for multi-project scheduling based on key chain. The algorithm is divided into two modules. In order to break the limitation of priority rules, genetic algorithm is used to find the optimal priority list of project activities. In view of the difficulty of solving the multi-project scheduling problem with complex multi-resource constraints by traditional critical chain multi-project scheduling algorithm, a priority based key chain multi-project scheduling algorithm is proposed, and the two algorithms are combined with each other. A critical chain scheduling scheme that ensures the robustness and quality robustness of the solution. Then the effectiveness of the algorithm is verified by an example and compared with other algorithms. The simulation results show that the proposed robust scheduling model can effectively improve the robustness of the scheduling scheme. Finally, the work of this paper is summarized and the direction of further research is put forward.
【學(xué)位授予單位】：華中科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2011
【分類號(hào)】：TH186

【引證文獻(xiàn)】

相關(guān)碩士學(xué)位論文 前1條

1 曾金鳳;基于關(guān)鍵鏈技術(shù)的項(xiàng)目進(jìn)度管理研究[D];重慶大學(xué);2012年

，

本文編號(hào)：2326923