供應鏈環(huán)境下具有等待約束的Flow-shop調(diào)度問題研究
[Abstract]:With the emergence of supply chain management (SCM), domestic and foreign scholars begin to study the production scheduling problem of manufacturing enterprises in supply chain environment. Traditional production scheduling aims at the maximum benefit or minimum cost of a single enterprise, and the local optimization is realized. However, under the environment of supply chain, enterprises are required to re-establish manufacturing objectives, establish scheduling model to meet the supply chain environment, improve the enterprise's rapid response ability, timely delivery capacity, and achieve the overall optimization of the supply chain. Considering the characteristics of supply chain environment, the models of no-wait and limited-wait Flow-shop scheduling in supply chain environment are established, and the model is empirically studied by using genetic algorithm (GA). This study mainly includes three aspects. Firstly, the research hot spots, research trends and research inadequacies are analyzed, and the research methods and research contents are explained in detail. In this paper, the Flow-shop scheduling theory, supply chain scheduling theory and genetic algorithm involved in the research process are discussed, which provides the theoretical basis and guidance for the study of the problem. Second, with regard to the uniqueness of the supply chain environment, the constraints of time, equipment, transportation, and so on, are fully taken into account. With the aim of minimizing the sum of the inventory costs in the manufacturing enterprise and the inventory costs in the distribution enterprise during the period from the completion of the product processing to the delivery to the distribution enterprise and the penalty cost to the manufacturing enterprise for the delay in delivery, The models of no-wait and finite-wait Flow-shop scheduling in supply chain environment are established respectively. Because the complexity of the problem is different, the genetic algorithm with different selection, crossover and mutation operation is used to simulate the problem, and the validity of the model and algorithm is verified. Thirdly, the established scheduling model is applied to the actual production in the supply chain environment, so as to guide the production of the manufacturing enterprises in the supply chain environment and arrange the production reasonably. To minimize the cost of manufacturing enterprises and downstream distribution enterprises in supply chain environment, so as to achieve the overall optimal supply chain.
【學位授予單位】:燕山大學
【學位級別】:碩士
【學位授予年份】:2014
【分類號】:F274;TP301.6
【參考文獻】
相關(guān)期刊論文 前10條
1 黃明;劉鵬飛;梁旭;;不確定條件下的作業(yè)車間多目標調(diào)度模型及其遺傳優(yōu)化[J];大連交通大學學報;2012年01期
2 姚建明;劉麗文;;MC下供應鏈調(diào)度的制約因素及主導矛盾分析[J];工業(yè)工程;2007年05期
3 陳士軍;;基于供應鏈的農(nóng)機制造企業(yè)生產(chǎn)計劃調(diào)度研究[J];中國農(nóng)機化;2007年03期
4 李俊芳;李鐵克;王偉玲;;約束滿足混合算法求解提前/拖期Job Shop調(diào)度問題[J];計算機工程與應用;2010年16期
5 衣楊,汪定偉;并行多機成組工作總流水時間調(diào)度問題[J];計算機集成制造系統(tǒng)-CIMS;2001年07期
6 孫鑫;陳秋雙;龍磊;徐海濤;;三層供應鏈聯(lián)合調(diào)度算法研究[J];計算機集成制造系統(tǒng);2006年04期
7 楊開兵;劉曉冰;;無成組技術(shù)條件下流水車間調(diào)度的多目標優(yōu)化[J];計算機集成制造系統(tǒng);2009年02期
8 劉延風;劉三陽;;改進微粒群優(yōu)化求解置換流水車間調(diào)度問題[J];計算機集成制造系統(tǒng);2009年10期
9 陳友玲;張永陽;孫亞南;肖瑩姣;胡春花;;基于Petri網(wǎng)的敏捷化生產(chǎn)調(diào)度建模方法[J];計算機集成制造系統(tǒng);2010年03期
10 楊宏安;孫啟峰;孫樹棟;郭杰;;基于遺傳算法的作業(yè)車間提前/拖期調(diào)度問題[J];計算機集成制造系統(tǒng);2011年08期
相關(guān)博士學位論文 前1條
1 熊峰;供應鏈協(xié)同調(diào)度研究[D];武漢理工大學;2009年
本文編號:2451524
本文鏈接:http://sikaile.net/guanlilunwen/gongyinglianguanli/2451524.html