本文關(guān)鍵詞：基于混合遺傳禁忌搜索算法的多目標(biāo)柔性作業(yè)車間調(diào)度問題研究　出處：《重慶大學(xué)》2012年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 工件目標(biāo)差異 多目標(biāo)柔性作業(yè)車間調(diào)度 混合遺傳禁忌搜索算法 多目標(biāo)計(jì)算方法 雙資源約束

【摘要】：車間調(diào)度是制造型企業(yè)生產(chǎn)管理的核心部分，對(duì)企業(yè)的盈利能力有著舉足輕重的作用。歷經(jīng)半個(gè)多世紀(jì)，針對(duì)經(jīng)典作業(yè)車間調(diào)度問題的研究已經(jīng)取得了豐富的理論成果，但是所建立的模型還不能很好的反映實(shí)際生產(chǎn)，不能很好的指導(dǎo)生產(chǎn)。而在經(jīng)典作業(yè)車間調(diào)度問題基礎(chǔ)上發(fā)展來(lái)的多目標(biāo)柔性作業(yè)車間調(diào)度問題，能夠綜合考慮企業(yè)內(nèi)部各部門的決策期望，更好的適應(yīng)現(xiàn)代生產(chǎn)模式的需求，對(duì)其研究有著重要的理論意義和實(shí)踐意義。 本文在經(jīng)典作業(yè)車間調(diào)度的基礎(chǔ)上，描述了柔性作業(yè)車間調(diào)度問題，并對(duì)多目標(biāo)柔性作業(yè)車間調(diào)度問題進(jìn)行了建模，，設(shè)計(jì)了求解算法，主要內(nèi)容如下： ①提出了包括最大完工時(shí)間、平均流經(jīng)時(shí)間、瓶頸機(jī)器總負(fù)荷、機(jī)器總負(fù)荷、工件交貨期、工件加工成本、產(chǎn)品質(zhì)量的多個(gè)目標(biāo)，并引入了基于工件目標(biāo)不同的多目標(biāo)優(yōu)化概念，并給出了各目標(biāo)的計(jì)算方法。 ②針對(duì)工件目標(biāo)不同的多目標(biāo)調(diào)度問題提出了一種混合遺傳禁忌搜索算法，并采用了一種基于工序和機(jī)器的編碼方式，以及新型的基于工序和機(jī)器的交叉方式，建立了調(diào)度算法。 ③分析了目前常用的多目標(biāo)優(yōu)化算法，并選定了一種改進(jìn)的NSGA-ⅡPareto排序方法。 ④建立了更貼近實(shí)際生產(chǎn)的基于工件加工目標(biāo)不同的多目標(biāo)柔性作業(yè)車間調(diào)度問題模型，并提出了以機(jī)床和工人為雙約束，工件交貨期為主要目標(biāo)，總加工成本、瓶頸機(jī)器總負(fù)荷、總完工時(shí)間、單件工件加工成本、單件工件加工質(zhì)量、單件工件完工時(shí)間為次優(yōu)化目標(biāo)的調(diào)度模型。 ⑤以實(shí)際項(xiàng)目為基礎(chǔ)，對(duì)上述模型進(jìn)行了仿真，驗(yàn)證了模型和算法的有效性。
[Abstract]:Job shop scheduling is the core part of production management in manufacturing enterprises, which plays an important role in the profitability of enterprises and has lasted for more than half a century. The research on the classical job shop scheduling problem has made a lot of theoretical achievements, but the established model can not well reflect the actual production. The multi-objective flexible job shop scheduling problem developed on the basis of the classical job shop scheduling problem can comprehensively consider the decision-making expectations of various departments within the enterprise. It is of great theoretical and practical significance to better adapt to the demand of modern production mode. Based on the classical job shop scheduling, the flexible job shop scheduling problem is described in this paper, and the multi-objective flexible job shop scheduling problem is modeled, and a solution algorithm is designed. The main contents are as follows: The main contents are as follows: (1) multiple objectives including the maximum completion time, the average flow time, the total load of the bottleneck machine, the total load of the machine, the delivery time of the workpiece, the processing cost of the workpiece, and the quality of the product are proposed. The concept of multi-objective optimization based on different object of workpiece is introduced, and the calculation method of each target is given. 2. A hybrid genetic Tabu search algorithm is proposed for multi-objective scheduling problem with different job targets, and a coding method based on process and machine is adopted. And a new scheduling algorithm based on process and machine intersection is established. 3. The commonly used multi-objective optimization algorithm is analyzed, and an improved NSGA- 鈪

本文編號(hào)：1389713