發(fā)布時(shí)間：2018-09-10 11:52

【摘要】：伴隨著市場(chǎng)競(jìng)爭(zhēng)的不斷加劇和越來(lái)越個(gè)性化、多樣化的客戶需求,制造業(yè)由大規(guī)模生產(chǎn)進(jìn)入了大規(guī)模定制生產(chǎn)階段。和大規(guī)模的備貨生產(chǎn)相比,大規(guī)模定制由于要滿足客戶定制需求必然在生產(chǎn)成本和交貨期等方面面臨巨大挑戰(zhàn)。它必須面對(duì)的無(wú)法回避的基本問(wèn)題,是怎樣在滿足定制策略下客戶的個(gè)性化、多樣化需求的前提下又能實(shí)現(xiàn)大規(guī)模生產(chǎn)的低費(fèi)用、高速度。實(shí)現(xiàn)低成本快速反應(yīng),生產(chǎn)作業(yè)調(diào)度計(jì)劃是一個(gè)關(guān)鍵環(huán)節(jié)。作業(yè)車間調(diào)度問(wèn)題屬于NP-hard問(wèn)題,是優(yōu)化問(wèn)題中最難求解的問(wèn)題。本文首先研究了大規(guī)模定制的基本內(nèi)容以及其特點(diǎn)。對(duì)生產(chǎn)調(diào)度的相關(guān)問(wèn)題和理論進(jìn)行了較為詳盡的闡述,對(duì)相關(guān)的調(diào)度算法進(jìn)行了初步探討。分析了汽車沖壓車間生產(chǎn)調(diào)度現(xiàn)狀、特征以及存在的問(wèn)題,為沖壓車間的生產(chǎn)調(diào)度優(yōu)化構(gòu)建了模型。簡(jiǎn)單介紹了S公司沖壓車間的生產(chǎn)情況。其次概述了遺傳算法的基本概念,基本步驟,分析了遺傳算法實(shí)現(xiàn)方法,即參數(shù)與操作的設(shè)計(jì)。介紹了免疫遺傳算法的原理、產(chǎn)生的背景和原因,分析了免疫遺傳算法的操作和基本流程。構(gòu)建了基于免疫遺傳算法(IGA)的沖壓車間調(diào)度模型。最后對(duì)設(shè)計(jì)的改進(jìn)的免疫遺傳算法的性能進(jìn)行了驗(yàn)證,通過(guò)對(duì)FT10問(wèn)題的計(jì)算,從和幾個(gè)傳統(tǒng)方法的比較中可以證明算法的有效性。另外還對(duì)簡(jiǎn)化了的S公司的沖壓車間的生產(chǎn)調(diào)度進(jìn)行了優(yōu)化求解。
[Abstract]:With the aggravation and individuation of the market competition and the diversification of customer demand, the manufacturing industry has entered the stage of mass customization production from mass production. Compared with mass stocking, mass customization is bound to face great challenges in production cost and delivery time. The basic problem it must face is how to realize the low cost and high speed of mass production on the premise of satisfying the customer's individuation and diversified demand under the customized strategy. In order to achieve low cost and fast response, production scheduling is a key step. Job shop scheduling problem belongs to NP-hard problem and is the most difficult problem to solve in optimization problem. This paper first studies the basic content of mass customization and its characteristics. The related problems and theories of production scheduling are expounded in detail, and the related scheduling algorithms are discussed. The present situation, characteristics and existing problems of production scheduling of automobile stamping shop are analyzed, and a model for production scheduling optimization of stamping shop is built. This paper briefly introduces the production situation of the press workshop of S Company. Secondly, the basic concept and steps of genetic algorithm are summarized, and the implementation method of genetic algorithm, namely the design of parameters and operation, is analyzed. This paper introduces the principle, background and reason of immune genetic algorithm, and analyzes the operation and basic flow of immune genetic algorithm. A stamping shop scheduling model based on immune genetic algorithm (IGA) is constructed. Finally, the performance of the improved immune genetic algorithm (IGA) is verified. The effectiveness of the proposed algorithm can be proved by comparing the proposed algorithm with several traditional methods through the calculation of the FT10 problem. In addition, the simplified production scheduling of S Company's stamping shop is solved optimally.
【學(xué)位授予單位】：大連海事大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：F426.4

【參考文獻(xiàn)】

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

1 周亞勤,李蓓智,楊建國(guó);調(diào)整時(shí)間與工序順序相關(guān)的Job Shop調(diào)度優(yōu)化方法研究[J];中國(guó)機(jī)械工程;2005年10期

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

1 馬煥雯;汽車制造沖壓車間生產(chǎn)計(jì)劃與生產(chǎn)調(diào)度的研究[D];武漢理工大學(xué);2013年

，

本文編號(hào)：2234363