本文關(guān)鍵詞：具有多模式的FFS作業(yè)計劃制定方法　出處：《廣東工業(yè)大學(xué)》2012年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 柔性流水車間 多模式 調(diào)度 蟻群算法

【摘要】：柔性流水作業(yè)車間調(diào)度問題是傳統(tǒng)車間作業(yè)調(diào)度問題的擴(kuò)展,該類調(diào)度更加靈活,也更加符合實際車間生產(chǎn)情況,是迫切需要解決的一類調(diào)度問題。目前很多針對柔性流水作業(yè)車間調(diào)度問題的研究均將問題建立在工件不存在資源多模式的基礎(chǔ)上,而在實際生產(chǎn)過程中,工件在加工過程中往往具有多種加工模式可選,一種加工模式代表一組資源需求量及相應(yīng)任務(wù)工期,不同的資源投入量對應(yīng)不同的任務(wù)工期。在任務(wù)具有多種執(zhí)行模式的情況下,合理安排任務(wù)的執(zhí)行模式可以節(jié)約資源、降低成本、縮短工期。因此,研究多模式下柔性流水車間調(diào)度問題就顯得十分有意義。 本文首先采用數(shù)學(xué)規(guī)劃的方法對多模式下柔性流水車間調(diào)度問題進(jìn)行建模,建立了基于JIT生產(chǎn)模式的目標(biāo)函數(shù),并考慮了加工模式的設(shè)備資源約束。 其次,針對問題的特點,設(shè)計了一種混合蟻群算法求解上述調(diào)度模型。該算法第一部分利用蟻群算法確定部件的加工工作中心和加工模式,第二部分利用部件優(yōu)先級來確定工作中心前的部件任務(wù)隊列順序。 然后,將蟻群算法應(yīng)用在實際問題中。第一步,利用蟻群算法求解柔性流水車間調(diào)度問題中的三個基準(zhǔn)實例,并將求解結(jié)果與其他算法求解結(jié)果對比,以此說明蟻群算法在解決該類問題的有效性和優(yōu)越性。第二步,通過企業(yè)實際生產(chǎn)數(shù)據(jù)構(gòu)建了仿真實例,利用混合蟻群算法對五組數(shù)據(jù)分別進(jìn)行了求解,并將求解結(jié)果與其他文獻(xiàn)中的蟻群算法求解結(jié)果對比,以此說明本文對蟻群算法中信息素更新規(guī)則的改進(jìn)十分有效。第三步,考慮到生產(chǎn)車間的實際情況,應(yīng)用蟻群算法設(shè)計了一種基于滑動窗口機制的滾動調(diào)度策略,并用測試實例說明了策略的有效性。 最后,以合作企業(yè)的車間為背景,在現(xiàn)有ERP系統(tǒng)的基礎(chǔ)上,構(gòu)建了以蟻群算法模塊為核心的部件調(diào)度系統(tǒng)框架,并且.詳細(xì)說明了系統(tǒng)總體流程。
[Abstract]:Flexible flow shop scheduling problem is an extension of the traditional job shop scheduling problem. This kind of scheduling is more flexible and more in line with the actual production situation. It is an urgent need to solve a kind of scheduling problem. At present, many researches on flexible flow shop scheduling problem are based on the fact that there is no resource multi-mode in the workpiece, but in the actual production process. In the process of workpiece processing, there are many kinds of machining modes that can be selected, one kind of processing mode represents a group of resource demand and the corresponding task duration. Different resource inputs correspond to different task duration. When the task has multiple execution modes, reasonably arranging the task execution mode can save resources, reduce cost and shorten the duration. It is very meaningful to study the flexible income job shop scheduling problem in multiple modes. In this paper, the mathematical programming method is used to model the flexible income job shop scheduling problem in multiple modes, and the objective function based on JIT production mode is established, and the equipment resource constraints in the machining mode are considered. Secondly, according to the characteristics of the problem, a hybrid ant colony algorithm is designed to solve the above scheduling model. The first part of the algorithm uses ant colony algorithm to determine the machining center and processing mode of components. The second part uses component priority to determine the order of component task queue before work center. Then, the ant colony algorithm is applied to the practical problem. The first step is to use the ant colony algorithm to solve the flexible income job shop scheduling problem with three benchmark examples, and the results are compared with the results of other algorithms. In order to illustrate the effectiveness and superiority of ant colony algorithm in solving this kind of problem. The second step, through the actual production data of the enterprise to build a simulation example, using the hybrid ant colony algorithm to solve the five groups of data respectively. The results are compared with the results of ant colony algorithm in other literatures, which shows that this paper is very effective to improve the pheromone updating rules in ant colony algorithm. The third step, considering the actual situation of the production workshop. A rolling scheduling strategy based on sliding window mechanism is designed by using ant colony algorithm, and the effectiveness of the strategy is illustrated by a test example. Finally, based on the existing ERP system, a component scheduling system framework with ant colony algorithm module as the core is constructed based on the workshop of the cooperative enterprise, and the overall flow of the system is explained in detail.
【學(xué)位授予單位】：廣東工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2012
【分類號】：TH165

【參考文獻(xiàn)】

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

1 段海濱;王道波;于秀芬;;蟻群算法的研究現(xiàn)狀及其展望[J];中國工程科學(xué);2007年02期

2 王延斌,高國安,趙立忠;具有工件約束的模具制造優(yōu)化調(diào)度算法研究[J];計算機集成制造系統(tǒng);2005年10期

3 何霆,劉飛,馬玉林,楊海;車間生產(chǎn)調(diào)度問題研究[J];機械工程學(xué)報;2000年05期

4 張超勇;饒運清;李培根;邵新宇;;柔性作業(yè)車間調(diào)度問題的兩級遺傳算法[J];機械工程學(xué)報;2007年04期

5 張國輝;高亮;李培根;張超勇;;改進(jìn)遺傳算法求解柔性作業(yè)車間調(diào)度問題[J];機械工程學(xué)報;2009年07期

6 侯立文,蔣馥;一種基于螞蟻算法的交通分配方法及其應(yīng)用[J];上海交通大學(xué)學(xué)報;2001年06期

7 吳秀麗;;柔性作業(yè)車間動態(tài)調(diào)度問題研究[J];系統(tǒng)仿真學(xué)報;2008年14期

8 王萬良;趙澄;熊婧;徐新黎;;基于改進(jìn)蟻群算法的柔性作業(yè)車間調(diào)度問題的求解方法[J];系統(tǒng)仿真學(xué)報;2008年16期

9 張紀(jì)會,徐心和;一種新的進(jìn)化算法——蟻群算法[J];系統(tǒng)工程理論與實踐;1999年03期

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

1 張國輝;柔性作業(yè)車間調(diào)度方法研究[D];華中科技大學(xué);2009年

，

本文編號：1394496