【摘要】：隨著制造業(yè)發(fā)展，作業(yè)車間調(diào)度問題的實(shí)現(xiàn)過程也變得越來越復(fù)雜化。車間調(diào)度問題是一類集各約束條件的組合優(yōu)化問題，對(duì)于該問題具有很實(shí)際的一個(gè)應(yīng)用背景，因此該領(lǐng)域也一直是研究的熱點(diǎn)，自上世紀(jì)80年以來，隨著各學(xué)科領(lǐng)域之間的相互滲透，也出現(xiàn)了許多研究方法，并涌現(xiàn)了大量有價(jià)值的文獻(xiàn)。可是該問題被證明是一個(gè)NP難問題，所以至今沒有一個(gè)確定可行的解決方案，這也吸引了越來越多的學(xué)者對(duì)此進(jìn)行研究，近幾年也提出了很多具有重要意義的調(diào)度算法，這也激發(fā)了學(xué)者對(duì)調(diào)度問題研究的熱情。在如此的背景下，車間調(diào)度問題的研究就成了更加具有意義的事情。 就目前對(duì)調(diào)度問題的研究已經(jīng)有十多種，其中對(duì)作業(yè)車間進(jìn)行仿真建模有Petri網(wǎng)、控制等方法，本文選用了Petri作為作業(yè)車間調(diào)度問題研究建模工具，因?yàn)镻etri網(wǎng)發(fā)展至今已有60多年的歷史，是一個(gè)非常成熟的基于數(shù)學(xué)化的建模工具，基于Petri網(wǎng)的模型可以對(duì)調(diào)度系統(tǒng)進(jìn)行實(shí)時(shí)的仿真。目前Petri網(wǎng)常對(duì)離散的事件進(jìn)行分析和建模，根據(jù)Petri網(wǎng)功能選擇可以對(duì)系統(tǒng)網(wǎng)集成建模。從此可以看出本文選用Petri網(wǎng)為車間調(diào)度的建模設(shè)計(jì)提供了便利。文中首先根據(jù)調(diào)度問題的描述利用時(shí)延Petri網(wǎng)對(duì)簡(jiǎn)單的車間調(diào)度問題進(jìn)行建模，并隨之提出了時(shí)間有色Petri網(wǎng)對(duì)復(fù)雜的調(diào)度問題進(jìn)行了建模分析，通過本文提出的建模方法可以直觀的看出復(fù)雜調(diào)度問題的調(diào)度情況，也驗(yàn)證了本文提出的建模理論是可行的。 根據(jù)Petri建模后對(duì)基因表達(dá)式編程的編碼進(jìn)行設(shè)計(jì)，本文提出了不同于傳統(tǒng)的基因表達(dá)式編程編碼，，在本文算法中，基因表達(dá)式編程根據(jù)時(shí)延Petri網(wǎng)模型中的變遷序列來確立染色體的尾部，每條染色體尾部可以確立一種車間調(diào)度方案。本文選用了基因表達(dá)式的選擇、交叉、變異三種類型進(jìn)行遺傳操作。其中交叉、變異操作也不同于原型Petri網(wǎng)，本文根據(jù)調(diào)度問題設(shè)計(jì)了特定的遺傳操作。 最后本文根據(jù)Petri網(wǎng)對(duì)車間調(diào)度問題的仿真，通過變遷的時(shí)延時(shí)間獲得每條染色體的相應(yīng)的時(shí)間，結(jié)合基因表達(dá)式編程具有較好的尋優(yōu)能力和Petri網(wǎng)對(duì)動(dòng)態(tài)的離散事件的過程能進(jìn)行很好的描述的優(yōu)點(diǎn)對(duì)仿真實(shí)例進(jìn)行實(shí)驗(yàn)，最后通過實(shí)驗(yàn)數(shù)據(jù)的比較來驗(yàn)證本文所提出的算法的可行性。
[Abstract]:With the development of manufacturing industry, the realization process of job shop scheduling problem has become more and more complex. Job shop scheduling problem is a kind of combinatorial optimization problem with various constraints. It has a very practical application background for this problem, so this field has been a hot research topic since 80 years of last century. With the mutual penetration of various disciplines, there are also many research methods, and a large number of valuable literature has emerged. However, this problem has been proved to be a difficult NP problem, so far there is no definite and feasible solution, which has attracted more and more scholars to study it, and a lot of important scheduling algorithms have been proposed in recent years. This also arouses the enthusiasm of scholars for the research of scheduling problem. In this context, the research of job shop scheduling problem has become more meaningful. At present, there are more than ten kinds of research on scheduling problem, among which there are Petri net, control and other methods for the simulation modeling of job shop. In this paper, Petri is selected as the modeling tool for job shop scheduling problem research. Because Petri net has been developed for more than 60 years, it is a very mature modeling tool based on mathematics. The model based on Petri net can simulate the scheduling system in real time. At present, Petri net often analyzes and models discrete events, and the system network integration can be modeled according to the function selection of Petri net. It can be seen that Petri net is selected to facilitate the modeling and design of job shop scheduling. In this paper, according to the description of scheduling problem, the delay Petri net is used to model the simple job shop scheduling problem, and then the time colored Petri net is proposed to model and analyze the complex scheduling problem. Through the modeling method proposed in this paper, we can intuitively see the scheduling of complex scheduling problems, and verify that the modeling theory proposed in this paper is feasible. According to the design of gene expression programming after Petri modeling, this paper proposes a gene expression programming coding which is different from the traditional gene expression programming coding. In this algorithm, Gene expression programming establishes the tail of chromosome according to the transition sequence in delay Petri net model, and a job shop scheduling scheme can be established at the tail of each chromosome. In this paper, three types of genetic expression, crossing and variation, were selected for genetic operation. The crossing and mutation operations are different from the prototype Petri net. In this paper, a specific genetic operation is designed according to the scheduling problem. Finally, according to the simulation of job shop scheduling problem by Petri net, the corresponding time of each chromosome is obtained by the transition delay time. Combined with the advantages of gene expression programming, which has good optimization ability and Petri net can describe the process of dynamic discrete events, the simulation example is tested. Finally, the feasibility of the proposed algorithm is verified by comparing the experimental data.
【學(xué)位授予單位】：廣西師范學(xué)院
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP301.1;TB49

【共引文獻(xiàn)】

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

1 黃恩洲;吳少雄;;基于遺傳算法—多智能體的FMS工件調(diào)度研究[J];廣西大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年05期

2 黃恩洲;;FMS多智能體調(diào)度系統(tǒng)投標(biāo)算法和評(píng)估模型[J];廣西工學(xué)院學(xué)報(bào);2013年04期

3 黃恩洲;;粒子群—禁忌搜索的FMS多智能體調(diào)度[J];遼寧工程技術(shù)大學(xué)學(xué)報(bào)(自然科學(xué)版);2014年04期

4 牛占文;徐照光;;一類零緩沖可中斷流水線調(diào)度優(yōu)化方法[J];工業(yè)工程;2014年05期

5 李作成;錢斌;胡蓉;羅蓉娟;張桂蓮;;遺傳-分布估計(jì)算法求解化工生產(chǎn)中一類帶多工序的異構(gòu)并行機(jī)調(diào)度問題[J];化工學(xué)報(bào);2014年03期

6 花季偉;李曉婷;;基于改進(jìn)型批決策與調(diào)度建模的生產(chǎn)計(jì)劃調(diào)度系統(tǒng)的研究[J];計(jì)算機(jī)工程與科學(xué);2014年02期

7 趙詩(shī)奎;方水良;顧新建;;基于極限調(diào)度完工時(shí)間最小化的機(jī)器選擇及FJSP求解[J];計(jì)算機(jī)集成制造系統(tǒng);2014年04期

8 廖珊;翟所霞;魯玉軍;;基于改進(jìn)遺傳算法的柔性作業(yè)車間調(diào)度方法研究[J];機(jī)電工程;2014年06期

9 花季偉;李曉婷;;基于遺傳算法的MES熱軋型鋼生產(chǎn)計(jì)劃調(diào)度系統(tǒng)的研究[J];計(jì)算機(jī)應(yīng)用與軟件;2013年10期

10 周清華;王大澳;王慧;;基于自適應(yīng)遺傳算法的混合流水車間調(diào)度研究[J];科技廣場(chǎng);2014年10期

相關(guān)會(huì)議論文 前1條

1 ZHOU Wei;BU Yan-ping;ZHOU Ye-qing;;Research on Partner Selection Problem of Virtual Enterprise Based on Improved Genetic Algorithm[A];第26屆中國(guó)控制與決策會(huì)議論文集[C];2014年

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

1 吳立華;不確定環(huán)境下模具制造車間前攝與反應(yīng)式調(diào)度方法研究[D];廣東工業(yè)大學(xué);2013年

2 仁慶道爾吉;車間作業(yè)調(diào)度問題的多目標(biāo)模型建立及其算法[D];西安電子科技大學(xué);2013年

3 崔U

本文編號(hào)：2492642