本文選題：鋼鐵生產(chǎn) + 供應(yīng)鏈計劃　； 參考：《東北大學(xué)》2015年博士論文

【摘要】：供應(yīng)鏈計劃與調(diào)度是供應(yīng)鏈管理中優(yōu)化資源配置、合理安排生產(chǎn)與物流等活動的過程,也是以供需匹配贏得競爭優(yōu)勢的途徑。鋼鐵工業(yè)屬于多階段流程型制造業(yè),不同階段在生產(chǎn)工藝、制造模式、產(chǎn)品特征等方面具有較大的差異,從而導(dǎo)致不同階段之間決策的沖突,為供應(yīng)鏈計劃與調(diào)度的理論、方法及技術(shù)的深入發(fā)展提供了研究背景。供應(yīng)鏈計劃與調(diào)度的優(yōu)化已成為鋼鐵運(yùn)營中急需解決的關(guān)鍵問題,這些優(yōu)化問題通�？蓺w結(jié)為難解的組合優(yōu)化問題,因此探討適合這些問題的有效算法已成為學(xué)術(shù)界關(guān)注的熱點(diǎn)。本文針對從鋼鐵生產(chǎn)中提煉出的燒結(jié)-煉鐵低碳供應(yīng)鏈計劃、煉鋼-熱軋生產(chǎn)與物流供應(yīng)鏈計劃、煉鋼-連鑄-熱軋供應(yīng)鏈調(diào)度問題,建立了相應(yīng)的混合整數(shù)規(guī)劃模型,分析問題結(jié)構(gòu)和特征,分別設(shè)計了基于列生成的分支定價最優(yōu)算法。主要內(nèi)容概述如下：1)燒結(jié)-煉鐵低碳供應(yīng)鏈計劃是在滿足鐵水需求的情況下,考慮碳排放總量控制與交易機(jī)制,根據(jù)燒結(jié)與煉鐵兩個階段的生產(chǎn)配方要求,確定原燃料采購、生產(chǎn)配方的選擇、原燃料與燒結(jié)礦的庫存、碳交易的優(yōu)化問題。以最小化采購、生產(chǎn)、庫存和碳交易成本為目標(biāo),建立了混合整數(shù)規(guī)劃模型。該模型的特點(diǎn)為把碳排放控制機(jī)制與組合優(yōu)化相結(jié)合,在考慮多階段經(jīng)濟(jì)性目標(biāo)的同時,兼顧了碳減排的需要。2)燒結(jié)-煉鐵低碳供應(yīng)鏈計劃問題的算法研究。針對常規(guī)算法對該問題在大規(guī)模下難以快速獲得最優(yōu)解,設(shè)計了基于列生成的分支定價最優(yōu)算法。提出了兩種改進(jìn)策略,一是在分析煉鐵生產(chǎn)中燒結(jié)礦消耗數(shù)量關(guān)系的基礎(chǔ)上提出兩類不影響子問題結(jié)構(gòu)和算法的有效不等式以提升下界,二是基于子問題路徑的檢驗數(shù)進(jìn)行變量消除來降低搜索空間從而提高算法性能。實驗結(jié)果顯示所提出的算法性能優(yōu)于商業(yè)求解軟件CPLEX,驗證了算法的有效性。3)煉鋼-熱軋生產(chǎn)與物供應(yīng)鏈流計劃研究。與常規(guī)單階段不同,熱軋需求的多樣性與煉鋼規(guī)模生產(chǎn)的沖突導(dǎo)致中間產(chǎn)品板坯和成品熱軋卷的不合理庫存以及需求的延期交貨。在考慮煉鋼和熱軋受能力限制、兩階段之間三種連接方式的情況下,以最小化生產(chǎn)與物流成本及延期交貨懲罰為目標(biāo),建立混合整數(shù)規(guī)劃模型。設(shè)計了基于列生成的分支定價算法。從理論上分析了極點(diǎn)的性質(zhì),提出凸化和投影離散化的混合分解方法,實現(xiàn)整數(shù)變量和連續(xù)變量的分離,從而達(dá)到了對模型更為緊湊的等價變換和改進(jìn)列生成收斂性的目的。實驗結(jié)果表明了算法的有效性。4)煉鋼-連鑄-熱軋供應(yīng)鏈調(diào)度問題是在滿足各階段生產(chǎn)工藝約束的情況下,分析爐次、澆次和板坯之間的關(guān)系,確定它們在機(jī)器上的排序和調(diào)度時間的問題。以最小化爐次和板坯等待懲罰以及熱軋生產(chǎn)切換成本為目標(biāo),建立混合整數(shù)規(guī)劃模型。該模型不僅包含爐次和澆次對機(jī)器的選擇和排序,還包板坯對軋制單元的選擇和排序,以及熱軋機(jī)上軋制單元的排序問題,具有復(fù)雜的耦合約束。5)煉鋼-連鑄-熱軋供應(yīng)鏈調(diào)度問題的算法研究。提出了基于機(jī)器和軋制單元的調(diào)度時間窗對原問題進(jìn)行了更為緊湊的Dantzig-Wolfe分解策略,把煉鋼和連鑄階段子問題歸結(jié)為具有時間窗的最小化總加權(quán)完成時間的單機(jī)調(diào)度問題,提出了子問題的最優(yōu)性并設(shè)計了雙向動態(tài)規(guī)劃算法求解。把熱軋軋制單元子問題歸結(jié)為具有資源約束和線性時間依賴成本的無環(huán)最短路問題,引入狀態(tài)空間松弛技術(shù)設(shè)計了偽多項式時間算法求解。根據(jù)熱軋生產(chǎn)的工藝要求,提出一類改進(jìn)的能力有效不等式以提升基于列生成的分支定價算法的性能。實驗結(jié)果驗證了算法的有效性。
[Abstract]:Supply chain planning and scheduling are the process of optimizing resource allocation in supply chain management, arranging the activities of production and logistics, and also the way to win the competitive advantage by matching supply and demand. The iron and steel industry belongs to the multi stage process manufacturing industry, and the different stages have great differences in the production process, manufacturing mode and product characteristics, and thus lead to great differences. The conflict between different stages of decision making provides a research background for the theory, method and technology of supply chain planning and scheduling. The optimization of supply chain planning and scheduling has become the key problem to be solved urgently in iron and steel operation. These optimization problems can be summed up as difficult combinatorial optimization problems. Therefore, the discussion is suitable for these problems. The effective algorithm of the problem has become a hot topic in the academic field. In this paper, the sintering iron and iron low carbon supply chain plan, the steelmaking hot rolling production and logistics supply chain plan, the steelmaking continuous casting hot rolling supply chain scheduling problem, the corresponding mixed integer programming model are established, and the structure and characteristics of the problem are analyzed. The main content of the branch pricing optimal algorithm based on the column generation is summarized as follows: 1) the sintering and iron smelting low carbon supply chain plan is to consider the total carbon emission control and trading mechanism under the condition of meeting the demand of molten iron, and to determine the purchase of raw fuel, the selection of the production formula and the original combustion, according to the requirements of the two stages of sintering and ironmaking. In order to minimize the cost of purchasing, production, inventory and carbon trading, a mixed integer programming model is established to minimize the purchase, production, inventory and carbon trading costs. The model is characterized by combining carbon emission control mechanism with combined optimization, considering the multi-stage economic target and taking into account the need of carbon emission reduction.2) sintering and refining. Research on the algorithm of iron low carbon supply chain planning. Aiming at the problem that the conventional algorithm is difficult to obtain the optimal solution to this problem on a large scale, a branch pricing optimal algorithm based on column generation is designed. Two kinds of improvement strategies are proposed. One is to put forward two kinds of non influence sub problems on the basis of analyzing the quantity relation of sinter consumption in iron making production. The effective inequality of structure and algorithm is used to improve the lower bounds. Two is to reduce the search space based on the test number of the subproblem path to reduce the search space and improve the performance of the algorithm. The experimental results show that the performance of the proposed algorithm is better than the commercial solution software CPLEX, and validates the effectiveness of the algorithm.3) the steelmaking hot rolling production and supply chain flow plan. Different from the conventional single stage, the conflict between the variety of hot rolling demand and the scale production of steelmaking leads to the irrational inventory of slab and finished products of intermediate products and the delayed delivery of demand. In the case of three connections between the two stages, the cost and the delay of production and logistics are minimized considering the capacity limit of steelmaking and hot rolling. The goal of delivery penalty is to establish a mixed integer programming model. The branch pricing algorithm based on column generation is designed. The properties of the pole are analyzed in theory. The hybrid decomposition method of convexity and projection discretization is proposed to separate the integer variables and continuous variables, thus achieving a more compact equivalent transformation and an improved column for the model. The experimental results show the effectiveness of the algorithm. The results show the effectiveness of the algorithm.4) the scheduling problem of steelmaking continuous casting hot rolling supply chain is to analyze the relationship between the furnace times, the pouring time and the slab, and to determine the scheduling and scheduling time on the machine, in order to minimize the number of furnace and the slab. The mixed integer programming model is established for the penalty and the switching cost of hot rolling production. The model includes not only the selection and ordering of the furnace and the pouring time to the machine, but also the selection and ordering of the rolling unit for the slab, the ordering of the rolling units on the hot rolling mill, and the complex coupling constraint.5) for the steelmaking continuous casting hot rolling supply chain scheduling question. A more compact Dantzig-Wolfe decomposition strategy based on the scheduling time window based on machine and rolling unit is proposed. The problem of steelmaking and continuous casting order is reduced to a single machine scheduling problem with a time window to minimize the total weighted completion time. The optimality of the sub problem is proposed and the two-way motion is designed. The problem of the hot rolling rolling unit is reduced to the loop shortest path problem with resource constraints and linear time dependent costs, and the pseudo polynomial time algorithm is designed by the state space relaxation technique. According to the requirements of the hot rolling production, a class of effective inequalities for the ability to modify is proposed to improve the column generation based on the process requirements of hot rolling production. The performance of the branch pricing algorithm is proved. The experimental results verify the effectiveness of the algorithm.

【學(xué)位授予單位】：東北大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2015
【分類號】：F274;F426.31

【參考文獻(xiàn)】

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

1 王建華;李南;郭慧;;基于時間槽的敏捷供應(yīng)鏈集成調(diào)度模型及優(yōu)化[J];系統(tǒng)工程理論與實踐;2011年02期

2 戴道明;;價格敏感需求下能力受限批量問題的混合算法[J];系統(tǒng)仿真學(xué)報;2009年03期

3 蔡政英;肖人彬;譚勇;龔鳳美;;不確定條件下循環(huán)供應(yīng)鏈模糊自適應(yīng)生產(chǎn)計劃調(diào)度[J];控制與決策;2008年05期

4 李昆鵬;馬士華;;ATO供應(yīng)鏈中航空運(yùn)輸及并行機(jī)生產(chǎn)協(xié)調(diào)調(diào)度問題[J];系統(tǒng)工程理論與實踐;2007年12期

5 黃玲;鐘金宏;楊善林;;考慮延期交貨、轉(zhuǎn)包和非減庫存能力約束的單產(chǎn)品批量模型[J];系統(tǒng)工程理論與實踐;2007年09期

6 常桂娟;張紀(jì)會;;基于無等待約束的供應(yīng)鏈在線調(diào)度問題[J];復(fù)旦學(xué)報(自然科學(xué)版);2007年04期

7 但斌;肖劍;劉曉紅;張旭梅;李志威;湯華麗;;基于交貨期窗口約束的多級供應(yīng)鏈批量調(diào)度問題研究[J];計算機(jī)集成制造系統(tǒng);2007年02期

8 高振,唐立新;列生成與GUB相結(jié)合求解鋼鐵原料采購批量問題(英文)[J];自動化學(xué)報;2004年01期

9 朱寶琳,于海斌;煉鋼-連鑄-熱軋生產(chǎn)調(diào)度模型及算法研究[J];計算機(jī)集成制造系統(tǒng)-CIMS;2003年01期

10 陳劍,蔡連僑;供應(yīng)鏈建模與優(yōu)化[J];系統(tǒng)工程理論與實踐;2001年06期

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

1 寧樹實;煉鋼—連鑄—熱軋一體化生產(chǎn)調(diào)度研究及應(yīng)用[D];大連理工大學(xué);2006年

，

本文編號：1790796