本文選題：最早開始時間策略　切入點：緩沖工序提前遷移策略　出處：《哈爾濱理工大學》2017年碩士論文

【摘要】：傳統(tǒng)的產(chǎn)品制造過程,將加工和裝配作為兩個獨立的階段,對問題的研究主要針對零部件的批量加工。隨著社會多元化需求的增加,多品種小批量的訂單逐漸增多,在這種多元化需求環(huán)境驅(qū)動下,需要一種新的生產(chǎn)調(diào)度模式,滿足人們個性化定制型產(chǎn)品的需求。這樣,綜合調(diào)度應(yīng)運而生,它將產(chǎn)品的加工過程和裝配過程統(tǒng)一為加工過程,將復雜產(chǎn)品虛擬映射為樹狀加工樹。由于同時考慮了工序間的順序約束和裝配約束,綜合調(diào)度在縮短產(chǎn)品制造周期、提高生產(chǎn)系統(tǒng)效率方面,具有重要的研究意義和實際應(yīng)用價值。經(jīng)過多年的發(fā)展,綜合調(diào)度問題的研究已由單車間生產(chǎn)環(huán)境發(fā)展到了分布式生產(chǎn)環(huán)境,而現(xiàn)階段研究的焦點主要針對二車間綜合調(diào)度問題,并且已經(jīng)取得了不錯的研究成果。但是,以往的二車間綜合調(diào)度問題研究文獻,只考慮了復雜產(chǎn)品在普通設(shè)備上的加工情況。而隨著加工技術(shù)、自動化技術(shù)的發(fā)展,柔性制造系統(tǒng)和數(shù)控加工中心等帶有一定柔性的生產(chǎn)系統(tǒng)在實際企業(yè)生產(chǎn)中扮演著越來越重要的角色,柔性作業(yè)車間調(diào)度問題更加符合實際生產(chǎn)問題。因此本文主要研究存在柔性加工設(shè)備的二車間綜合調(diào)度問題。針對復雜產(chǎn)品在具有柔性加工設(shè)備的二車間進行綜合調(diào)度問題,本文首先提出了基于最早開始時間的二車間柔性綜合調(diào)度算法,提出最早開始時間策略、最快處理速度策略以及長路徑策略,在每次迭代循環(huán)中,同時確定待調(diào)度工序,工序的加工車間、設(shè)備以及開工時間,實例驗證表明,該算法能夠較好的解決復雜產(chǎn)品在存在柔性加工設(shè)備的二車間進行綜合調(diào)度問題。其次,針對貪心算法并不一定每次都產(chǎn)生較好解的問題,提出基于集束搜索的二車間柔性綜合調(diào)度算法,算法采用集束搜索的框架,將上述策略作為局部選擇策略,提出過濾規(guī)則,限制產(chǎn)生的孩子節(jié)點個數(shù),提出全局評估策略,為每個父節(jié)點工序保留唯一的孩子節(jié)點,算法復雜度分析及實例驗證表明,所提算法在增加了復雜度的前提下實現(xiàn)了調(diào)度結(jié)果的優(yōu)化。最后,本文提出緩沖工序提前遷移的二車間柔性綜合調(diào)度算法,采用父路徑長優(yōu)先策略、長用時策略以及可用設(shè)備少策略確定工序的調(diào)度順序;提出葉節(jié)點工序選擇策略、緩沖工序提前遷移策略以及普通工序處理策略確定工序的加工車間和加工設(shè)備;采用前沿貪心策略的思想,結(jié)合產(chǎn)品工藝約束、遷移時間約束以及機器占用約束確定工序的開工時間,復雜度分析及實例驗證表明,該算法同樣能夠在較低的復雜度內(nèi)實現(xiàn)產(chǎn)品在存在柔性加工設(shè)備的二車間的綜合調(diào)度。
[Abstract]:In the traditional manufacturing process, machining and assembly are regarded as two independent stages.With the increase of social diversified demand, the orders of multiple varieties and small batches are increasing gradually. Driven by this diversified demand environment, a new production scheduling mode is needed to meet the needs of personalized customized products.In this way, integrated scheduling emerges as the times require. It unifies the machining process and assembly process of the product into the machining process, and maps the complex product virtual to the tree-like machining tree.Because the sequential constraints and assembly constraints among the processes are considered at the same time, the comprehensive scheduling has important research significance and practical application value in shortening the production cycle and improving the efficiency of production system.After years of development, the research of integrated scheduling problem has been developed from a single workshop production environment to a distributed production environment. At this stage, the focus of the research is mainly on the two-shop integrated scheduling problem, and good research results have been achieved.However, in the previous literature, only the complex products are processed on the common equipment.With the development of machining technology and automation technology, flexible manufacturing system and NC machining center are playing more and more important role in actual enterprise production.Flexible job shop scheduling problem is more in line with the actual production problem.Therefore, this paper mainly studies the two-shop integrated scheduling problem with flexible processing equipment.Aiming at the problem of integrated scheduling of complex products in the second job shop with flexible processing equipment, this paper first proposes a flexible integrated scheduling algorithm based on the earliest start time, and puts forward the earliest start time strategy.The fastest processing speed strategy and long path strategy, in each iteration cycle, at the same time to determine the scheduling process, the process workshop, equipment and start up time, examples show that,The algorithm can solve the complex product scheduling problem in the second workshop with flexible processing equipment.Secondly, aiming at the problem that greedy algorithm does not always produce a better solution, a two-shop flexible integrated scheduling algorithm based on cluster search is proposed. The algorithm adopts the framework of cluster search and takes the above strategy as the local selection strategy.A filtering rule is proposed to limit the number of child nodes generated, and a global evaluation strategy is proposed to preserve a unique child node for each parent node process.The proposed algorithm achieves the optimization of scheduling results on the premise of increasing complexity.Finally, this paper proposes a flexible and integrated scheduling algorithm for the second workshop, which uses the long path priority strategy, long time strategy and less available equipment strategy to determine the scheduling order of the process, and proposes the selection strategy of the leaf node process.The buffer process migration strategy and the common process processing strategy are used to determine the process workshop and processing equipment, and the idea of frontier greedy strategy is adopted, and the product process constraints are combined.Migration time constraint and machine occupation constraint are used to determine the start time of the process. The complexity analysis and the example verification show that the algorithm can also achieve the integrated scheduling of the product in the second workshop with flexible machining equipment in the lower complexity.
【學位授予單位】：哈爾濱理工大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TP301.6;TB497

【參考文獻】

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

1 謝志強;王有為;辛宇;邵俠;;利用工序遷移時間的兩車間設(shè)備驅(qū)動綜合調(diào)度算法[J];上海交通大學學報;2016年06期

2 周炳海;王騰;;考慮多約束的混合流水車間MOJ調(diào)度[J];控制與決策;2016年05期

3 王凌;鄧瑾;王圣堯;;分布式車間調(diào)度優(yōu)化算法研究綜述[J];控制與決策;2016年01期

4 趙詩奎;韓青;王桂從;;基于虛擬零部件級別分區(qū)編碼的產(chǎn)品綜合調(diào)度算法[J];計算機集成制造系統(tǒng);2015年09期

5 謝志強;于潔;陳德運;楊靜;;基于鄰域渲染的二車間綜合調(diào)度算法[J];機械工程學報;2016年01期

6 謝志強;鄭付萍;朱天浩;周含笑;;兩車間可調(diào)度工序均衡處理的綜合調(diào)度算法[J];計算機工程;2014年01期

7 張蕾;;復雜作業(yè)模式下車間動態(tài)調(diào)度問題的研究[J];機械設(shè)計與制造工程;2013年03期

8 伊華偉;;基于符號編碼的裝配可行解域大小求解算法研究[J];遼寧工業(yè)大學學報(自然科學版);2013年01期

9 張其亮;陳永生;韓斌;;改進的粒子群算法求解置換流水車間調(diào)度問題[J];計算機應(yīng)用;2012年04期

10 謝志強;辛宇;楊靜;;基于設(shè)備空閑事件驅(qū)動的綜合調(diào)度算法[J];機械工程學報;2011年11期

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

1 黃英杰;基于目標級聯(lián)法和智能優(yōu)化算法的車間調(diào)度問題研究[D];華南理工大學;2012年

，

本文編號：1716896