本文選題：虛擬單元構(gòu)建 + 跨單元調(diào)度�。� 參考：《江蘇科技大學(xué)》2017年碩士論文

【摘要】：虛擬單元制造系統(tǒng)(Virtual Cellular Manufacturing System,VCMS)是單元生產(chǎn)方式在制造企業(yè)應(yīng)用的進(jìn)一步發(fā)展,得到了越來越多國家的關(guān)注和重視,然而由于工件到達(dá)的隨機(jī)性,以及虛擬單元物理位置不改變而帶來的復(fù)雜的車間流問題,虛擬單元制造系統(tǒng)中往往存在工件在機(jī)器前較長的排隊等待情況。鑒于此,本文采用成批服務(wù)排隊網(wǎng)絡(luò)策略,著重考慮排隊等待因素的影響,從而進(jìn)一步優(yōu)化復(fù)雜的單元路徑選擇和減少零件排隊等待時間,顯著提高設(shè)備利用率,縮短零件生產(chǎn)周期,企業(yè)快速響應(yīng)顧客需求。當(dāng)工件以一定批量隨機(jī)達(dá)到以及在設(shè)備上加工時間不確定時,如果現(xiàn)有的虛擬單元不能夠滿足待加工工件的生產(chǎn)需求,該批量的工件需要排隊等待加工。因此成批量服務(wù)的虛擬單元調(diào)度問題分為兩個階段,第一個階段是在復(fù)雜的車間流中選擇合適的加工路徑進(jìn)行虛擬單元構(gòu)建,以減少排隊等待的問題研究,第二階段是在構(gòu)建完成基礎(chǔ)上,虛擬單元中排隊等待加工的工件動態(tài)調(diào)度問題研究。關(guān)于虛擬單元構(gòu)建問題,考慮車間復(fù)雜的車間流即生產(chǎn)路徑,本文基于數(shù)學(xué)規(guī)劃及網(wǎng)絡(luò)圖論等相關(guān)理論,綜合零件的多工藝生產(chǎn)路線、生產(chǎn)批量、加工時間、排隊等待費用、設(shè)備服務(wù)強(qiáng)度等因素,提出了一種成批服務(wù)排隊網(wǎng)絡(luò)下最優(yōu)路徑選擇方法。在零件成批服務(wù)的策略下,構(gòu)建了以零件加工成本最小化和排隊等待費用最小化,以及設(shè)備服務(wù)強(qiáng)度最小化的多目標(biāo)模型,提出了新的最優(yōu)路徑?jīng)Q策方法,篩選出了最優(yōu)的加工路徑,避免了零件排隊等待。該方法實現(xiàn)了減少零件排隊等待同時保證了單元車間復(fù)雜流的簡單化。基于路徑選擇的基礎(chǔ)上,進(jìn)行生產(chǎn)制造資源的聚類分析,設(shè)計了基于馬氏距離的零件族相似劃分算法,實現(xiàn)了虛擬單元的構(gòu)建。關(guān)于虛擬單元調(diào)度問題,本文將每個虛擬單元看作一個節(jié)點,考慮零件的排隊等待,研究了成批服務(wù)排隊網(wǎng)絡(luò)下由于多工藝引起的跨單元生產(chǎn)調(diào)度問題。利用排隊網(wǎng)絡(luò)理論將每一個虛擬單元看作是一個節(jié)點,將虛擬單元制造系統(tǒng)作為一個整體排隊網(wǎng)絡(luò),通過網(wǎng)絡(luò)圖論的方式將各單元節(jié)點等效為一個M/M/C排隊模型,通過外部到達(dá)率計算網(wǎng)絡(luò)內(nèi)部各節(jié)點的輸入?yún)?shù),在工件成批服務(wù)的策略下,以零件跨單元加工的總加工流程時間最小、設(shè)備最大負(fù)荷最小化作為調(diào)度目標(biāo),構(gòu)建了成批服務(wù)的排隊網(wǎng)絡(luò)模型。通過免疫遺傳算法求解模型,實現(xiàn)了跨單元總流程加工時間最短,加工路徑最優(yōu),減少了零件排隊等待。最后,本文在對HDZH公司作業(yè)班組的機(jī)加工生產(chǎn)現(xiàn)狀及存在問題進(jìn)行詳細(xì)分析的基礎(chǔ)上,運用基于成批服務(wù)排隊網(wǎng)絡(luò)下虛擬單元構(gòu)建和跨單元調(diào)度的方法,對造船企業(yè)的機(jī)加工軸系和舵系的生產(chǎn)過程進(jìn)行分析,以驗證本文所提研究方案在實際企業(yè)中的應(yīng)用價值及意義。研究結(jié)果表明,本文所提出的研究方案具有較高的可行性和有效性。
[Abstract]:Virtual Cellular Manufacturing system (VCM) is the further development of the application of cell production in manufacturing enterprises, and has been paid more and more attention by more and more countries. However, due to the randomness of workpiece arrival, And the complex workshop flow problem caused by the unchanging physical position of the virtual cell. In the virtual cell manufacturing system, there is always a long queue waiting in front of the machine. In view of this, this paper adopts batch service queuing network strategy, emphasizes the influence of queuing and waiting factors, and further optimizes the complex cell path selection and reduces the queuing waiting time of parts, and improves the equipment utilization rate significantly. Shorten parts production cycle, enterprises respond to customer needs quickly. If the existing virtual unit can not meet the production demand of the workpiece to be processed, the batch workpiece needs to be queued for processing when the workpiece is reached randomly in a certain batch and the processing time on the equipment is uncertain. Therefore, the virtual cell scheduling problem of batch service is divided into two stages. The first stage is to select the appropriate processing path in the complex shop flow to construct the virtual cell, so as to reduce the problem of queue waiting. In the second stage, the dynamic scheduling problem of the jobs queued and processed in the virtual cell is studied on the basis of the completion of the construction. Regarding the problem of virtual cell construction, considering the complex workshop flow, that is, the production path, based on mathematical planning and network graph theory, this paper synthesizes the multi-process production route of parts, production batch, processing time, queue waiting cost, etc. In this paper, an optimal path selection method for batch service queuing network is proposed. Under the strategy of part batch service, a multi-objective model based on the minimization of parts processing cost and queue waiting cost, as well as the minimization of equipment service intensity, is constructed, and a new optimal path decision method is proposed. The optimal processing path is selected to avoid waiting in queue. This method can reduce the queue waiting of parts and ensure the simplification of complex flow in the unit workshop. On the basis of path selection, the clustering analysis of manufacturing resources is carried out, and the similarity partition algorithm of parts family based on Markov distance is designed to realize the construction of virtual cell. For the problem of virtual cell scheduling, this paper considers each virtual cell as a node, considers the queue waiting of parts, and studies the cross-cell production scheduling problem caused by multi-process in batch service queueing network. Each virtual cell is regarded as a node by using queuing network theory, and the virtual cell manufacturing system is regarded as a whole queueing network. Each cell node is equivalent to a M/M/C queuing model by network graph theory. The input parameters of each node in the network are calculated by the external arrival rate. Under the strategy of batch service of the workpiece, the minimum processing time and the minimum maximum load of the parts across the unit are taken as the scheduling objectives. The queuing network model of batch service is constructed. The immune genetic algorithm (IGA) is used to solve the model, which realizes the shortest processing time and the optimal machining path, and reduces the queue waiting of the parts. Finally, based on the detailed analysis of the production status and existing problems of job teams in HDZH Company, this paper applies the method of virtual cell construction and cross-cell scheduling based on batch service queuing network. The production process of machined shafting and rudder system in shipbuilding enterprises is analyzed in order to verify the application value and significance of the research scheme proposed in this paper in practical enterprises. The results show that the proposed scheme is feasible and effective.
【學(xué)位授予單位】：江蘇科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：F426.474;O226

【參考文獻(xiàn)】

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

1 朱明珠;齊二石;楊甫勤;;基于開排隊網(wǎng)絡(luò)的醫(yī)院門診服務(wù)臺優(yōu)化配置[J];工業(yè)工程與管理;2016年05期

2 蔣南云;張琳;張英豪;張建緒;;基于Jackson排隊網(wǎng)絡(luò)的出廠檢驗環(huán)節(jié)資源配置優(yōu)化[J];工業(yè)工程與管理;2016年01期

3 張惠煜;陳慶新;毛寧;;基于排隊網(wǎng)的柔性裝配線設(shè)備優(yōu)化配置方法[J];計算機(jī)集成制造系統(tǒng);2015年12期

4 賈凌云;李冬妮;田云娜;;基于混合蛙跳和遺傳規(guī)劃的跨單元調(diào)度方法[J];自動化學(xué)報;2015年05期

5 徐立云;榮巨;郭昆吾;李愛平;;基于改進(jìn)粒子群算法的制造單元構(gòu)建方法研究[J];制造技術(shù)與機(jī)床;2014年03期

6 張磊;褚學(xué)寧;李玉鵬;孫習(xí)武;耿秀麗;郭立杰;;結(jié)構(gòu)化裝配工藝設(shè)計中的裝配單元劃分[J];機(jī)械設(shè)計與研究;2013年02期

7 汪浩祥;嚴(yán)洪森;;基于多Agent可互操作知識化制造動態(tài)自適應(yīng)調(diào)度策略[J];控制與決策;2013年02期

8 劉雪梅;朱麗君;李愛平;黃君政;;基于遺傳算法的生產(chǎn)車間制造單元構(gòu)建技術(shù)研究[J];制造技術(shù)與機(jī)床;2013年02期

9 賈國柱;欒世超;陳亮;閔成;;基于流程模塊化的虛擬制造單元構(gòu)建方法[J];系統(tǒng)工程理論與實踐;2012年10期

10 韓毅;蔡建湖;周根貴;李延來;唐加福;;多級生產(chǎn)批量規(guī)劃問題的柔性慣量反捕食粒子群算法[J];控制理論與應(yīng)用;2010年10期

，

本文編號：1868373