本文選題：跨車間生產(chǎn) + 機加裝配混合制造系統(tǒng)�。� 參考：《東北大學(xué)》2012年碩士論文

【摘要】：隨著生產(chǎn)水平的提高,以及需求的多元化,生產(chǎn)模式由單工序、大批量集中生產(chǎn)逐漸轉(zhuǎn)為多工序、多品種、變批量生產(chǎn)。由于單個車間的設(shè)備局限性,企業(yè)內(nèi)部不同車間的生產(chǎn)協(xié)作現(xiàn)象越來越頻繁,車間之間的協(xié)作計劃與調(diào)度愈加困難,這就對原有的生產(chǎn)調(diào)度方法提出了新的挑戰(zhàn)。本文以某機械制造企業(yè)車間運作管理實踐需求為背景,作為國家自然科學(xué)基金課題的重要組成部分,在對車間調(diào)度研究現(xiàn)狀進行分析與綜述的基礎(chǔ)上,特別針對一類具有多級機加和裝配關(guān)系的混合型制造系統(tǒng)的跨車間調(diào)度問題開展建模和優(yōu)化算法的研究,主要包括： (1)面向單級機加和裝配組成關(guān)系的零部件最優(yōu)調(diào)度策略研究。針對獨立生產(chǎn)車間只有一臺通用(萬能)機加設(shè)備和一臺裝配設(shè)備場景,提出兩種基本結(jié)構(gòu)單元及其描述方法,在此基礎(chǔ)上提出基于理想生產(chǎn)單元的理論最小完成時間計算方法；提出面向產(chǎn)品結(jié)構(gòu)圖的數(shù)學(xué)描述,并提出基于支路優(yōu)先級的調(diào)度策略；分別針對單機和并行多機情形下,一臺裝配設(shè)備的兩條支路產(chǎn)品結(jié)構(gòu),比較分析了三種不同的調(diào)度策略。 (2)面向多級機加和裝配組成關(guān)系的零部件調(diào)度策略。分別針對零件加工順序相同和不同情形,提出面向基本結(jié)構(gòu)單元的最小影響值的調(diào)度策略；考慮多級裝配,產(chǎn)品結(jié)構(gòu)具有兩條和三條支路,每種機加工設(shè)備單臺或多臺,裝配設(shè)備兩臺和三臺的不同場景,通過引進同步裝配的思想、最大(最小)時間差值和實際時間差值的概念,分別提出了基于同步裝配思想的兩種不同調(diào)度策略。 (3)雙跨車間零部件調(diào)度問題的兩種啟發(fā)式算法。針對協(xié)作(跨)車間生產(chǎn)情境,通過引進邏輯上的聯(lián)合車間調(diào)度(簡稱聯(lián)合調(diào)度)、參考加工起始時間、參考加工結(jié)束時間、加工延遲費用、滿意度增值效益(提前)等概念,從車間之間協(xié)調(diào)的視角,提出了以最小化總生產(chǎn)成本為目標(biāo)的雙跨車間調(diào)度問題的數(shù)學(xué)規(guī)劃模型,以平衡系統(tǒng)的總生產(chǎn)時間、各車間的延遲時間和提前時間(車間滿意度)。針對問題的特點,提出了基于聯(lián)合調(diào)度思想、嵌入遺傳搜索的啟發(fā)式調(diào)度方法和基于系統(tǒng)協(xié)調(diào)思想最小成本調(diào)度啟發(fā)式算法。這兩個算法將原問題分解為三個階段；第一、二階段采用基于兩層結(jié)構(gòu)圖的遺傳搜索算子求解零件的分批與指派問題；第三階段采用啟發(fā)式調(diào)度策略,完成最后的并行機調(diào)度。通過對不同測試算例、不同算法參數(shù)分析了兩種調(diào)度啟發(fā)式的性能。
[Abstract]:With the improvement of production level and the diversification of demand, the mode of production has gradually changed from single process, mass centralized production to multi-process, multi-variety and mass production. Because of the limitation of the equipment in a single workshop, the phenomenon of production cooperation among different workshops is becoming more and more frequent, and the planning and scheduling of cooperation between workshops becomes more and more difficult, which poses a new challenge to the original production scheduling methods. Based on the practical requirement of workshop operation management in a mechanical manufacturing enterprise, as an important part of the project of National Natural Science Foundation, this paper analyzes and summarizes the present situation of workshop scheduling research. In particular, the modeling and optimization algorithms for a class of hybrid manufacturing systems with multilevel machine addition and assembly relationship are studied, including: 1) Research on the optimal scheduling strategy of components for single stage machine adding and assembling. In view of the scene where there is only one universal (universal) machine and one assembly equipment in the independent production workshop, two basic structural units and their description methods are presented. On this basis, a theoretical minimum completion time calculation method based on ideal production unit is proposed, a mathematical description oriented to product structure diagram is proposed, and a scheduling strategy based on branch priority is proposed. The product structure of two branches of one assembly equipment is compared and three different scheduling strategies are analyzed. Second, the component scheduling strategy for multistage machine loading and assembly. According to the same and different machining sequence of parts, a scheduling strategy for the minimum influence value of basic structural unit is proposed. Considering multi-stage assembly, the product structure has two or three branches, and each machining equipment has one or more units. By introducing the concept of synchronous assembly, maximum (minimum) time difference and actual time difference, two different scheduling strategies based on synchronous assembly are proposed. 3) two heuristic algorithms for two-span job shop parts scheduling problem. According to the production situation of collaborative (cross) workshop, this paper introduces the concepts of logical joint workshop scheduling, referring to processing start time, processing end time, processing delay cost, satisfaction increment benefit (advance), and so on. From the perspective of coordination between workshops, a mathematical programming model for two-span job-shop scheduling problem with the goal of minimizing total production cost is proposed to balance the total production time of the system, the delay time of each workshop and the advance time (job shop satisfaction). According to the characteristics of the problem, a heuristic scheduling method based on the idea of joint scheduling and embedded genetic search and a heuristic algorithm of minimum cost scheduling based on the idea of system coordination are proposed. The two algorithms decompose the original problem into three stages: firstly, the genetic search operator based on two-layer structure graph is used to solve the part batch and assignment problem; the third stage uses heuristic scheduling strategy to complete the final parallel machine scheduling. The performance of two scheduling heuristics is analyzed by different test examples and different algorithm parameters.
【學(xué)位授予單位】：東北大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2012
【分類號】：TH186

【共引文獻】

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

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

2 劉興剛;;改進多種群雜交遺傳算法在作業(yè)車間調(diào)度的研究[J];電腦知識與技術(shù);2014年07期

3 郭理;邵明文;秦懷斌;;生產(chǎn)過程智能調(diào)度方法研究進展[J];福建電腦;2014年03期

4 軒華;孫振軒;李冰;;零等待混合流水車間問題優(yōu)化研究[J];工業(yè)工程與管理;2014年05期

5 李冬妮;肖廣雪;王妍;唐加福;;一種柔性路徑下的跨單元調(diào)度方法[J];自動化學(xué)報;2012年06期

6 張培文;潘全科;李俊青;段俊華;;有限緩沖區(qū)流水車間調(diào)度的混合人工蜂群算法[J];計算機集成制造系統(tǒng);2013年10期

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

8 崔U，

本文編號：1922250