【摘要】：分布式生產(chǎn)制造系統(tǒng)由多個分處異地的車間組成，通過長期的或臨時的合作，以松散的或者緊密的配合，完成共同的制造任務(wù)目標(biāo)，因而具有較強(qiáng)的動態(tài)性、不確定性和復(fù)雜性。其生產(chǎn)調(diào)度是一個多對象、多目標(biāo)優(yōu)化問題，比常規(guī)的調(diào)度優(yōu)化問題更難求解，需要尋求一種更加有效的調(diào)度策略，使其不僅能獲得最優(yōu)或接近最優(yōu)的調(diào)度結(jié)果，還能對生產(chǎn)制造過程中的變化做出快速響應(yīng)。本文以聯(lián)盟企業(yè)制造模式為例，對分布式柔性生產(chǎn)車間生產(chǎn)調(diào)度問題進(jìn)行研究，以期為制造車間優(yōu)化生產(chǎn)過程、提高經(jīng)濟(jì)效益提供有益參考和工具。 為解決動態(tài)環(huán)境下的生產(chǎn)調(diào)度問題，首先構(gòu)建制造系統(tǒng)的控制結(jié)構(gòu)模型，然后提出一種基于組合拍賣機(jī)制的分布調(diào)度策略，，設(shè)計蟻群優(yōu)化算法。 針對聯(lián)盟制造模式的特點，在對分布式生產(chǎn)調(diào)度問題分析的基礎(chǔ)上，提出一種分布-遞階混雜控制結(jié)構(gòu)，結(jié)構(gòu)內(nèi)容主要包括任務(wù)的分配和柔性車間內(nèi)優(yōu)化生產(chǎn)調(diào)度。基于控制結(jié)構(gòu)的運行原理，分別對任務(wù)分配問題及生產(chǎn)調(diào)度優(yōu)化問題進(jìn)行研究，重點分析任務(wù)分配問題。將組合拍賣機(jī)制運用到任務(wù)分配中，并詳細(xì)地論述了任務(wù)分配過程中拍賣機(jī)制的運作過程，給出基于組合拍賣機(jī)制的任務(wù)分配模型。為進(jìn)一步解決生產(chǎn)調(diào)度問題，根據(jù)每個分布企業(yè)具有柔性車間的特征，建立了柔性車間生產(chǎn)調(diào)度模型。 為了驗證所提出的基于組合拍賣機(jī)制的調(diào)度策略的可行性，充分應(yīng)用蟻群算法在解決離散組合優(yōu)化問題上的優(yōu)勢，本文針對任務(wù)分配及優(yōu)化調(diào)度問題，設(shè)計蟻群優(yōu)化算法。算法的設(shè)計主要從選擇機(jī)制和信息素更新機(jī)制上進(jìn)行優(yōu)化。 最后，本文以MATLAB R2010a為開發(fā)環(huán)境，采用MATLAB為編程語言，對研究的調(diào)度策略進(jìn)行驗證。結(jié)果既證明了算法的有效性，也說明本文針對分布式柔性車間提出的調(diào)度策略能夠達(dá)到滿意結(jié)果。
[Abstract]:The distributed manufacturing system is composed of many workshops located in different places. Through long-term or temporary cooperation and loose or close cooperation, the distributed manufacturing system accomplishes the common manufacturing task goal, so it has a strong dynamic character. Uncertainty and complexity. The production scheduling is a multi-object, multi-objective optimization problem, which is more difficult to solve than the conventional scheduling optimization problem. It needs to seek a more effective scheduling strategy, so that it can not only obtain the optimal or near optimal scheduling results. Can also make rapid response to the changes in the manufacturing process. This paper takes the manufacturing model of alliance enterprise as an example to study the production scheduling problem of distributed flexible production shop in order to provide useful reference and tools for optimizing production process and improving economic benefit of manufacturing shop. In order to solve the production scheduling problem in dynamic environment, the control structure model of manufacturing system is first constructed, and then a distributed scheduling strategy based on combinatorial auction mechanism is proposed to design ant colony optimization algorithm. Based on the analysis of distributed production scheduling problem, a distributed hierarchical hybrid control structure is proposed, which mainly includes task allocation and flexible production scheduling. Based on the operation principle of the control structure, the task assignment problem and the production scheduling optimization problem are studied respectively, and the task assignment problem is analyzed emphatically. The combination auction mechanism is applied to the task assignment, and the operation process of the auction mechanism in the task assignment process is discussed in detail, and the task assignment model based on the combination auction mechanism is given. In order to further solve the problem of production scheduling, according to the characteristics of each distributed enterprise with flexible workshop, the production scheduling model of flexible workshop is established. In order to verify the feasibility of the proposed scheduling strategy based on combinatorial auction mechanism and make full use of the advantages of ant colony algorithm in solving discrete combinatorial optimization problems, this paper designs an ant colony optimization algorithm for task allocation and optimal scheduling problems. The algorithm is designed from the selection mechanism and pheromone updating mechanism. Finally, using MATLAB R2010a as the development environment and MATLAB as the programming language, this paper verifies the proposed scheduling policy. The result not only proves the validity of the algorithm, but also shows that the scheduling strategy proposed in this paper for distributed flexible job shop can achieve satisfactory results.
【學(xué)位授予單位】：沈陽工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TH186;TP18

【參考文獻(xiàn)】

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

1 李立;劉元安;馬曉雷;;基于組合雙向拍賣的網(wǎng)格資源分配[J];電子學(xué)報;2009年01期

2 陳培友,汪定偉;組合拍賣競勝標(biāo)確定問題的優(yōu)化方法綜述[J];管理工程學(xué)報;2004年03期

3 齊繼陽;竺長安;;制造系統(tǒng)控制結(jié)構(gòu)的現(xiàn)狀和未來[J];江蘇科技大學(xué)學(xué)報(自然科學(xué)版);2010年01期

4 葛江華;馬國星;韓松濤;孫月洲;;動態(tài)聯(lián)盟伙伴選擇的優(yōu)化算法[J];哈爾濱理工大學(xué)學(xué)報;2010年05期

5 陳培友,汪定偉;組合拍賣競勝標(biāo)確定問題的混沌搜索算法[J];管理科學(xué)學(xué)報;2003年05期

6 于曉義;孫樹棟;司書賓;;航空制造業(yè)分布式協(xié)同生產(chǎn)計劃模式研究[J];計算機(jī)應(yīng)用研究;2009年07期

7 李莉;王克奇;;基于改進(jìn)型蟻群算法的MFJSSP研究[J];計算機(jī)應(yīng)用研究;2011年05期

8 陳瑋,張小花,鄧則名,陳田玉;基于動態(tài)聯(lián)盟的制造業(yè)信息化[J];機(jī)電工程技術(shù);2004年11期

9 張曉東,嚴(yán)洪森;多級車間生產(chǎn)計劃和調(diào)度的集成優(yōu)化[J];機(jī)械工程學(xué)報;2005年09期

10 張書亭,楊建軍,鄔學(xué)禮;敏捷制造執(zhí)行系統(tǒng)的調(diào)度策略研究[J];機(jī)械設(shè)計與制造工程;2001年03期

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

1 宋存利;生產(chǎn)調(diào)度問題及其智能優(yōu)化算法研究[D];大連理工大學(xué);2011年

本文編號：2272992