發(fā)布時(shí)間：2018-12-18 19:16

【摘要】：資源受限項(xiàng)目調(diào)度問(wèn)題是項(xiàng)目管理中的典型問(wèn)題，問(wèn)題中一般假設(shè)任務(wù)不允許被拆分，而在實(shí)際項(xiàng)目中，資源工作時(shí)間的不連續(xù)、緊急任務(wù)的加入、市場(chǎng)因素等通常需要任務(wù)被拆分成多次執(zhí)行。同時(shí)企業(yè)發(fā)展要求資源擁有多種技能。將這些因素引入問(wèn)題中具有十分重要的理論和現(xiàn)實(shí)意義。 本文首先分析了研究多技能資源任務(wù)可拆分項(xiàng)目調(diào)度的現(xiàn)實(shí)和理論意義，，并對(duì)RCPSP、PRCPSP、多技能資源的RCPSP問(wèn)題的研究現(xiàn)狀進(jìn)行總結(jié)。對(duì)問(wèn)題進(jìn)行清晰的界定和描述，構(gòu)建了數(shù)學(xué)模型，提出了求解此問(wèn)題的分支定界算法。此算法求解過(guò)程中以可行調(diào)度活動(dòng)集進(jìn)行分支，而利用節(jié)點(diǎn)的任務(wù)完成率來(lái)優(yōu)化分支和優(yōu)選過(guò)程；而從資源約束條件來(lái)看，資源擁有單技能時(shí)，通過(guò)對(duì)技能總量的比較而判斷任務(wù)組合的資源約束條件是否滿足，而資源擁有多技能時(shí)，通過(guò)對(duì)資源—技能矩陣的處理、對(duì)資源指派方案的編碼和解碼等過(guò)程計(jì)算資源對(duì)技能的提供量是否能滿足任務(wù)組合對(duì)技能的需求，從而判斷任務(wù)組合是否滿足資源約束條件。最后，通過(guò)Patterson實(shí)例集的測(cè)試，比較混合遺傳算法、粒子群算法與分支定界算法的目標(biāo)函數(shù)和運(yùn)行時(shí)間，可以看出中小型項(xiàng)目調(diào)度時(shí)，分支定界算法對(duì)解決多技能資源任務(wù)可拆分項(xiàng)目調(diào)度問(wèn)題的有效性和可行性。 本文的研究成果，理論上豐富了資源受限項(xiàng)目調(diào)度問(wèn)題的研究?jī)?nèi)容，而在動(dòng)態(tài)環(huán)境下，給定項(xiàng)目和資源配置參數(shù)，可以得到較好的調(diào)度方案，為項(xiàng)目經(jīng)理合理安排項(xiàng)目進(jìn)度提供指導(dǎo)。
[Abstract]:Resource constrained project scheduling problem is a typical problem in project management. It is generally assumed that tasks are not allowed to be split, while in actual projects, the discontinuity of resource working hours and the addition of urgent tasks are involved. Market factors, etc., usually require tasks to be split into multiple execution. At the same time, enterprise development requires resources to have a variety of skills. It is of great theoretical and practical significance to introduce these factors into the problem. This paper first analyzes the practical and theoretical significance of the research on multi-skill resource task divisible project scheduling, and summarizes the research status of RCPSP,PRCPSP, multi-skill resource RCPSP problem. The problem is clearly defined and described, a mathematical model is constructed, and a branch and bound algorithm is proposed to solve the problem. In this algorithm, the feasible scheduling activity set is used to branch, and the task completion rate of the node is used to optimize the branch and optimal selection process. From the point of view of resource constraints, when resources have a single skill, the resource constraints of task combination are judged by comparing the total skill amount, and when resources have multiple skills, they are processed by resource-skill matrix. The coding and decoding of resource assignment scheme can calculate whether the resource supply to skills can meet the requirement of task combination and determine whether task combination meets resource constraints. Finally, through the test of Patterson instance set, comparing the objective function and running time of hybrid genetic algorithm, particle swarm optimization and branch and bound algorithm, we can see the small and medium-sized project scheduling. The effectiveness and feasibility of branch and bound algorithm for solving the problem of split project scheduling of multi-skill resource tasks. The research results of this paper theoretically enrich the research content of resource-constrained project scheduling problem, but in dynamic environment, given project and resource allocation parameters, a better scheduling scheme can be obtained. Provide guidance for project manager to arrange project schedule.
【學(xué)位授予單位】：華中科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類號(hào)】：F224;F062.4

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 雒興剛;汪定偉;唐加福;;任務(wù)可拆分項(xiàng)目調(diào)度問(wèn)題[J];東北大學(xué)學(xué)報(bào)(自然科學(xué)版);2006年09期

本文編號(hào)：2386368