差异分批模式下供应链调度的近似算法设计与分析

发布时间：2018-05-26 18:16

本文选题：差异分批模式 + 供应链调度　；参考：《合肥工业大学》2017年硕士论文

【摘要】：在实际工业生产过程中,食品加工、陶瓷煅烧、电镀加工等行业往往面临这样一类问题:生产过程分批加工,作业尺寸与加工时间等属性各有差异,如何安排生产,库存与配送,才能使得供应链的服务跨度最优,或服务成本最优。这类问题被归结为差异批调度问题。解决这类问题应该摒弃传统的单一阶段优化方法,从全局考虑,从供应链的角度给决策者提供全面、具体的决策依据。这类问题求解复杂度较高,对模型构建和算法设计有极高的要求。本文研究一类典型的差异分批模式批调度问题,从制造企业的决策角度出发,设计集成化的分批、生产、库存和配送方案,来优化企业的供应链调度。研究由浅入深,从生产-配送两阶段问题的研究,深入到生产-库存-配送三阶段优化的研究。主要内容涵盖了最小化制造企业的服务跨度和最小化制造企业服务成本两类优化目标。在解决最小化服务跨度的问题时,本文建立了三种不同情况下的模型,分别给出了三种近似算法,并证明了三种算法的最坏性能比,就其中比较复杂的两种情况,还给出了具体的算例加以说明;在解决最小化服务成本的问题时,本文首先建立了整数规划模型,给出了计算复杂性的说明,然后提出了一种近似算法和用来说明算法过程的算例,最后证明了算法的最坏性能比。从理论上证明了算法的求解性能。文中提出的近似算法能为实际工业中的制造企业的供应链提供有切实意义的意见与参考。
[Abstract]:In the actual industrial production process, food processing, ceramic calcination, electroplating and other industries are often faced with such a kind of problems: the production process batch processing, job size and processing time and other attributes are different, how to arrange production, Inventory and distribution can optimize the service span or cost of the supply chain. This kind of problem is reduced to differential batch scheduling problem. To solve this kind of problems, we should abandon the traditional single-stage optimization method and provide the decision-makers with comprehensive and concrete decision basis from the point of view of the whole situation and from the point of view of supply chain. The complexity of solving this kind of problems is very high, which requires very high requirements for model building and algorithm design. In this paper, a class of typical batch scheduling problems with differential batching mode is studied. From the point of view of decision making of manufacturing enterprises, integrated batching, production, inventory and distribution schemes are designed to optimize the supply chain scheduling of enterprises. The research goes from simple to deep, from the study of production-distribution two-stage problem to the three-stage optimization of production-inventory-distribution. The main content includes two kinds of optimization objectives: minimizing service span of manufacturing enterprise and minimizing service cost of manufacturing enterprise. In solving the problem of minimizing service span, this paper establishes three models under different conditions, gives three approximate algorithms, and proves the worst-case performance ratio of the three algorithms. In order to solve the problem of minimizing the cost of service, the integer programming model is established, and the computational complexity is explained. Then an approximate algorithm and an example to illustrate the algorithm process are proposed, and the worst-case performance ratio of the algorithm is proved. The performance of the algorithm is proved theoretically. The approximate algorithm proposed in this paper can provide practical suggestions and references for the supply chain of manufacturing enterprises in actual industry.
【学位授予单位】：合肥工业大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：F274

【相似文献】