發(fā)布時(shí)間：2018-10-14 15:07

【摘要】：項(xiàng)目管理是第二次世界大戰(zhàn)后期發(fā)展起來(lái)的新管理技術(shù)之一,隨著世界經(jīng)濟(jì)的發(fā)展,組織規(guī)模的擴(kuò)大,在一系列項(xiàng)目管理大師的推動(dòng)下,項(xiàng)目管理已經(jīng)成為現(xiàn)代管理學(xué)中的重要組成部分。項(xiàng)目調(diào)度作為項(xiàng)目管理下的一個(gè)分支,自20世紀(jì)60年代(關(guān)鍵路徑法的誕生)至今,對(duì)單項(xiàng)目調(diào)度的研究已經(jīng)逐漸豐富完善,在現(xiàn)實(shí)中也有較多豐富的應(yīng)用,而多項(xiàng)目調(diào)度在現(xiàn)實(shí)中常有應(yīng)用,在研究領(lǐng)域則研究較少�？紤]到現(xiàn)實(shí)中多項(xiàng)目環(huán)境的實(shí)際情況(項(xiàng)目各有調(diào)度細(xì)節(jié)并共享部分資源),本文以分散式資源受限多項(xiàng)目調(diào)度為研究對(duì)象,基于拍賣理論建立多代理系統(tǒng)模型研究多項(xiàng)目并行調(diào)度問(wèn)題。本文的研究?jī)?nèi)容可分三個(gè)部分。第一部分研究考慮多模式單目標(biāo)的多項(xiàng)目調(diào)度問(wèn)題,在該問(wèn)題中,本文將考慮六種屬性的資源,包括本地可更新資源、本地不可更新資源、全局共享可更新資源、全局共享不可更新資源、全局專屬可更新資源以及全局專屬不可更新資源,并使用簡(jiǎn)單案例對(duì)所建立的算法體系進(jìn)行驗(yàn)證。第二部分研究單模式多目標(biāo)的多項(xiàng)目調(diào)度問(wèn)題,以本地/全局可更新資源為例,將關(guān)鍵鏈方法與多代理系統(tǒng)模型相結(jié)合,使用拍賣理論解決資源沖突問(wèn)題,并使用復(fù)雜案例對(duì)所建立算法體系進(jìn)行驗(yàn)證。第三部分研究將進(jìn)一步擴(kuò)展本文所提方法的應(yīng)用范圍,討論多代理系統(tǒng)與拍賣理論相結(jié)合,在更現(xiàn)實(shí)和廣泛的多項(xiàng)目調(diào)度環(huán)境中的應(yīng)用,并使用簡(jiǎn)單案例進(jìn)行闡述。本文主要研究分散式資源受限多項(xiàng)目調(diào)度問(wèn)題,主張?jiān)诜稚⑹江h(huán)境下,建立和利用內(nèi)部競(jìng)爭(zhēng)機(jī)制,以達(dá)到兼顧各方利益的目的,從而實(shí)現(xiàn)資源在多項(xiàng)目調(diào)度中的優(yōu)化配置。本文通過(guò)多代理系統(tǒng)建立基本架構(gòu),通過(guò)拍賣理論建立和解決競(jìng)爭(zhēng)機(jī)制,描述了在不同多項(xiàng)目環(huán)境下如何具體建立求解模型,對(duì)多項(xiàng)目調(diào)度領(lǐng)域的研究和實(shí)踐有積極的推動(dòng)意義。
[Abstract]:Project management is one of the new management techniques developed in the late World War II. With the development of the world economy and the expansion of the scale of the organization, it is promoted by a series of project management masters. Project management has become an important part of modern management. Project scheduling as a branch of project management, since the 1960s (the birth of the critical path method), the study of single project scheduling has been gradually enriched and perfected, and there are also a lot of rich applications in reality. However, multi-project scheduling is often applied in reality, but it is less studied in the field of research. Considering the actual situation of multi-project environment (each project has scheduling details and sharing part of resources), this paper takes decentralized resource-constrained multi-project scheduling as the research object. A multi-agent system model based on auction theory is established to study the multi-project parallel scheduling problem. The research content of this paper can be divided into three parts. In the first part, we consider the multi-project scheduling problem with multi-mode, single-objective and multi-mode. In this problem, we will consider six kinds of attribute resources, including local renewable resources, local non-renewable resources, global shared renewable resources. The global shared non-renewable resources, global exclusive renewable resources and global exclusive non-renewable resources are used to verify the proposed algorithm. In the second part, the multi-project scheduling problem with single mode and multi-objective is studied. Taking the local / global renewable resources as an example, the key chain method is combined with the multi-agent system model, and the auction theory is used to solve the resource conflict problem. A complex case is used to verify the proposed algorithm. The third part of the study will further expand the scope of application of the method proposed in this paper, discuss the combination of multi-agent system and auction theory, in a more realistic and extensive multi-project scheduling environment, and use a simple case to illustrate. In this paper, we mainly study the decentralized resource constrained multi-project scheduling problem, and advocate the establishment and utilization of the internal competition mechanism in the decentralized environment, so as to achieve the purpose of taking into account the interests of all parties, and thus realize the optimal allocation of resources in the multi-project scheduling. In this paper, the basic framework of multi-agent system is established, and the mechanism of competition is established and resolved by auction theory, and how to build the solution model in different multi-project environment is described. It has positive significance to the research and practice of multi-project scheduling.
【學(xué)位授予單位】：南京理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：F713.359

【參考文獻(xiàn)】

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

1 張沙清;陳新度;陳慶新;陳新;;基于改進(jìn)微粒群算法的模具多項(xiàng)目動(dòng)態(tài)調(diào)度[J];計(jì)算機(jī)集成制造系統(tǒng);2011年03期

2 應(yīng)瑛;壽涌毅;;基于組合拍賣方法的資源受限多項(xiàng)目調(diào)度[J];計(jì)算機(jī)集成制造系統(tǒng);2009年11期

3 鮑娜;張德賢;孫傲冰;王飛;;基于改進(jìn)蟻群算法的網(wǎng)格組合拍賣資源分配[J];計(jì)算機(jī)技術(shù)與發(fā)展;2009年10期

4 管在林;馬力;何敏;邵新宇;;基于貢獻(xiàn)度的項(xiàng)目調(diào)度方法研究[J];計(jì)算機(jī)集成制造系統(tǒng);2008年12期

5 馬國(guó)豐;尤建新;;關(guān)鍵鏈項(xiàng)目群進(jìn)度管理的定量分析[J];系統(tǒng)工程理論與實(shí)踐;2007年09期

6 姜姍;劉方愛(ài);;基于多任務(wù)拍賣的資源調(diào)度算法[J];計(jì)算機(jī)技術(shù)與發(fā)展;2006年12期

7 彭顯剛;劉藝;陳少華;;復(fù)雜系統(tǒng)的MAS分布式協(xié)作求解研究[J];微電子學(xué)與計(jì)算機(jī);2006年06期

8 呂賜興;朱云龍;尹朝萬(wàn);于海斌;;基于多Agent的敏捷生產(chǎn)調(diào)度中的協(xié)商策略[J];計(jì)算機(jī)集成制造系統(tǒng);2006年04期

9 唐曉波;文鵬;;基于多代理的網(wǎng)格服務(wù)中介及其應(yīng)用[J];情報(bào)雜志;2006年02期

10 壽涌毅;隨機(jī)抽樣算法在多項(xiàng)目調(diào)度中的應(yīng)用[J];管理工程學(xué)報(bào);2005年03期

，

本文編號(hào)：2270834