本文選題：虛擬單元 + 重調(diào)度��； 參考：《江蘇科技大學(xué)》2017年碩士論文

【摘要】：虛擬單元?jiǎng)討B(tài)調(diào)度和重調(diào)度是虛擬單元新的研究方向,并日益得到國(guó)內(nèi)外學(xué)者的關(guān)注和重視。然而,許多學(xué)者在研究此類問(wèn)題時(shí),并未充分考慮重調(diào)度對(duì)于初始調(diào)度的干擾程度,且并未有效利用批量分割的方法縮減工件的完工時(shí)間和生產(chǎn)總成本。鑒于此,本文在深入研究虛擬單元重調(diào)度、干擾管理和批量分割相關(guān)國(guó)內(nèi)外研究現(xiàn)狀和相關(guān)理論的基礎(chǔ)上,對(duì)急件訂單干擾下融入干擾管理方法和批量分割思想的虛擬單元重調(diào)度問(wèn)題進(jìn)行了較為細(xì)致的研究。本文急件訂單干擾下融入干擾管理方法和批量分割思想的虛擬單元重調(diào)度問(wèn)題的研究可分為兩個(gè)階段,第一階段為急件訂單干擾下考慮序位相似性的虛擬單元重調(diào)度問(wèn)題研究,在此階段,著重解決急件訂單干擾管理問(wèn)題;第二階段為虛擬單元模式下批量策略的確定問(wèn)題研究,在此階段,將批量分割的思想融入到急件訂單干擾下的重調(diào)度問(wèn)題當(dāng)中,以期較優(yōu)的柔性分批調(diào)度方案,確保在最大化資源利用的同時(shí),縮減工件的完工時(shí)間和完工總成本。關(guān)于急件訂單干擾下考慮序位相似性的虛擬單元重調(diào)度問(wèn)題,本文結(jié)合急件訂單特性,賦予急件訂單更高的生產(chǎn)優(yōu)先級(jí)。在急件訂單干擾出現(xiàn)時(shí),將急件訂單與原虛擬單元常規(guī)訂單的產(chǎn)品族和設(shè)備組進(jìn)行相似性判斷,在急件訂單能夠與原虛擬單元融合生產(chǎn)的情況下進(jìn)行虛擬單元重調(diào)度。同時(shí),設(shè)置了各工件工序可用機(jī)器集合和相應(yīng)的加工時(shí)間集合,構(gòu)建了以急件訂單完工時(shí)間、系統(tǒng)總流程時(shí)間最短和序位相似性最大為目標(biāo)的多目標(biāo)非線性整數(shù)規(guī)劃模型。針對(duì)模型自身特征,設(shè)計(jì)了遺傳--蟻群相結(jié)合的組合優(yōu)化算法求解模型。此外,借助干擾管理的方法,降低了急件訂單干擾對(duì)生產(chǎn)調(diào)度的影響。關(guān)于虛擬單元模式下批量策略的確定問(wèn)題,本文充分考慮時(shí)間和成本因素,提出了考慮批次啟動(dòng)時(shí)間的以總完工時(shí)間、總加工成本、總運(yùn)輸成本以及總拖期懲罰成本最小為目標(biāo)的多目標(biāo)非線性混合整數(shù)規(guī)劃模型。為有效的求解模型,將遺傳算法與工序優(yōu)先級(jí)調(diào)度算法相結(jié)合,提出了基于工序的兩階段編碼的優(yōu)化遺傳算法,該算法可以根據(jù)實(shí)際調(diào)度的需要將工件分割成具有柔性批量的多個(gè)子批,而且可以同時(shí)優(yōu)化子批的加工工藝路徑和加工排序方案。最后,本文在對(duì)HDZH機(jī)加工車間的生產(chǎn)現(xiàn)狀及存在的問(wèn)題進(jìn)行詳細(xì)分析的基礎(chǔ)上,將所提出的急件訂單干擾下融入干擾管理方法和批量分割思想的虛擬單元重調(diào)度問(wèn)題策略應(yīng)用到機(jī)加工車間舵系、軸系等產(chǎn)品的生產(chǎn)過(guò)程中,以驗(yàn)證本文所提出的方案在實(shí)際船舶企業(yè)生產(chǎn)中的應(yīng)用價(jià)值和意義。研究結(jié)果表明,本文所提出方法具有較高的可行性和優(yōu)越性。同時(shí),本文的研究對(duì)船舶等大型生產(chǎn)企業(yè)優(yōu)化生產(chǎn)流程具有一定的指導(dǎo)意義,在急件訂單干擾時(shí),為如何在生產(chǎn)成本和生產(chǎn)擾動(dòng)之間的權(quán)衡決策提供了一定的理論支持。
[Abstract]:Virtual cell dynamic scheduling and rescheduling is a new research direction of virtual cell, and has been paid more and more attention by scholars at home and abroad. However, many scholars do not fully consider the interference degree of rescheduling to the initial scheduling, and do not effectively use the method of batch partitioning to reduce the completion time and total production cost of the jobs. In view of this, on the basis of in-depth research on virtual cell rescheduling, interference management and batch segmentation, this paper studies the current situation and related theories at home and abroad. In this paper, the rescheduling problem of virtual cell with interference management and batch segmentation is studied in detail. In this paper, the research of virtual cell rescheduling with interference management method and batch segmentation under urgent order interference can be divided into two stages. The first stage is the virtual cell rescheduling problem which considers the sequence similarity under the urgent order interference. In this stage, the interference management problem of urgent orders is solved emphatically. In the second stage, the determination of batch policy in virtual cell mode is studied. In this stage, the idea of batch segmentation is integrated into the rescheduling problem under the interference of urgent orders. It is expected that the flexible batch scheduling scheme can reduce the completion time and the total cost of the work while maximizing the utilization of resources. For the problem of virtual cell rescheduling considering sequence similarity under urgent order interference, this paper gives a higher production priority to urgent order by combining the characteristics of urgent order. When the emergency order is disturbed, the product family and the equipment group of the emergency order and the normal order of the original virtual unit are judged, and the virtual unit rescheduling can be carried out when the urgent order can merge with the original virtual unit. At the same time, the available machine sets and the corresponding processing time sets are set up for each workpiece process, and a multi-objective nonlinear integer programming model aiming at the completion time of urgent orders, the shortest total process time and the largest sequence similarity is constructed. According to the characteristics of the model, a combined genetic-ant colony optimization algorithm is designed to solve the model. In addition, by means of interference management, the influence of urgent order interference on production scheduling is reduced. With regard to the determination of batch strategy in virtual cell mode, this paper takes full account of the factors of time and cost, and puts forward the total completion time and total processing cost, which take into account the starting time of batch. A multiobjective nonlinear mixed integer programming model with minimum total transportation cost and total tardiness penalty cost. In order to solve the model effectively, an optimized genetic algorithm based on two-stage coding is proposed by combining genetic algorithm with process priority scheduling algorithm. The algorithm can divide the jobs into multiple sub-batches with flexible batches according to the actual scheduling requirements and optimize the process path and scheduling scheme of the sub-batches at the same time. Finally, based on the detailed analysis of the production status and existing problems of HDZH machining workshop, The virtual cell rescheduling strategy, which integrates the interference management method and batch partition idea, is applied to the production process of the rudder system and shafting system in the machining workshop. In order to verify the application value and significance of the proposed scheme in actual shipbuilding production. The results show that the proposed method is feasible and superior. At the same time, the research in this paper has certain guiding significance for the ship and other large manufacturing enterprises to optimize the production process, and provides a certain theoretical support for how to balance the production cost and the production disturbance when the urgent order is disturbed.
【學(xué)位授予單位】：江蘇科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：F426.4;F273

【參考文獻(xiàn)】

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

1 韓文民;高龍龍;翁紅兵;黃勁松;;基于阻塞流理論的船舶建造中管件加工虛擬單元調(diào)度問(wèn)題研究[J];中國(guó)造船;2016年03期

2 李凱;周超;馬英;;考慮釋放時(shí)間的單機(jī)JIT調(diào)度問(wèn)題[J];運(yùn)籌與管理;2016年03期

3 薄洪光;張?chǎng)?潘裕韜;;混合無(wú)等待流水線干擾管理調(diào)度方法研究[J];運(yùn)籌與管理;2016年03期

4 李慶堂;楊建軍;;求解多工藝路線調(diào)度問(wèn)題的改進(jìn)遺傳算法[J];機(jī)械工程師;2016年04期

5 劉樂(lè);周泓;;新工件到達(dá)干擾下單機(jī)最大延遲時(shí)間重調(diào)度[J];系統(tǒng)工程學(xué)報(bào);2014年04期

6 陳勇;吳云翔;王亞良;魯建廈;;訂單不確定下雙資源約束多裝配線魯棒調(diào)度[J];中國(guó)機(jī)械工程;2014年12期

7 劉樂(lè);周泓;;一種常見(jiàn)干擾條件下的開(kāi)放式車間重調(diào)度研究[J];管理科學(xué)學(xué)報(bào);2014年06期

8 王海軍;王婧;馬士華;杜麗敬;;模糊供求條件下應(yīng)急物資動(dòng)態(tài)調(diào)度決策研究[J];中國(guó)管理科學(xué);2014年01期

9 劉鋒;王建軍;饒衛(wèi)振;楊德禮;;安裝時(shí)間與次序相關(guān)的生產(chǎn)調(diào)度干擾管理研究[J];中國(guó)管理科學(xué);2014年01期

10 汪德慶;王鵬飛;趙李飛;胡杰;丁榮;曹晶;;信息化造船技術(shù)研究綜述:敏捷造船與精益造船[J];軟件;2013年09期

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

1 宣琦;基于復(fù)雜網(wǎng)絡(luò)理論的復(fù)雜調(diào)度問(wèn)題求解方法研究[D];浙江大學(xué);2008年

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

1 陳娟;考慮資源約束與批量分割的虛擬單元?jiǎng)討B(tài)調(diào)度問(wèn)題研究[D];江蘇科技大學(xué);2013年

2 彭亞珍;基于DBR的多重入制造系統(tǒng)調(diào)度方法研究[D];北京化工大學(xué);2012年

，

本文編號(hào)：2010717