工件恶化的单机外包供应链排序问题

发布时间：2018-04-01 00:01

本文选题：供应链排序　切入点：外包　出处：《曲阜师范大学》2017年硕士论文

【摘要】：供应链管理一直是制造业研究的重点,而供应链排序是将排序理论应用到实际的供应链管理当中,企业以此来安排供应链中的生产加工和配送问题.在经典的排序问题中,工件的加工时间往往是已知且固定不变的,然而在实际的生产活动过程中,会出现工件的加工时间随其开工时间的推迟而增加的现象.同时,在一条灵活的供应链中,制造商并非接受来自客户的全部订单,往往会根据企业需要外包或拒绝部分工件以获得更大的利润空间.不仅如此,制造商需对已完成的工件及时配送至客户.因此,制造商如何选择接受工件集、如何安排接受工件集的生产排序与配送问题,并在此基础上,极小化持货成本、配送费用与外包费用总和,显得尤为重要.文章结构安排如下:第一章主要介绍了有关排序问题的基础知识、主要的概念以及组合最优化中的基本常识,并简要介绍了机器具有恶化效应、可外包的排序问题,最后简单说明本文所研究问题的研究现状和主要成果.第二章主要考虑了在外包总费用没有限制的情况下,具有恶化效应的单机外包供应链排序问题:制造商在零时刻获得所有需要加工的工件集,每个工件具有相同的基本加工时间,但工件的实际加工时间是其开工时间的简单线性增函数.每个工件既可以被加工,也可以选择外包给第三方制造商,外包工件需要支付相应的外包费用.制造商需要安排车辆对加工完的工件集分批运送至客户,安排在同一车辆的工件集视为一批,假设批容量无限、车辆无限.每个工件的发车时间是此工件所在批最后一个工件的完工时间,每个工件都有相应的单位时间持货成本.本章研究了在外包费用没有限制的情况下,极小化持货成本、配送费用与外包总费用之和.此时该问题可以在多项式时间内转化为最短路问题,证明了该问题属于P类问题;并在上述问题的基础上,研究了在运输总批数有限制的情况下,目标函数为持货成本与外包总费用之和的供应链排序问题.第三章在第二章的基础上考虑在外包费用有限制的情况下,目标函数是接受工件集的持货成本与配送费用之和,基于动态规划算法给出伪多项式时间算法.
[Abstract]:Supply chain management has been the focus of research and manufacturing, supply chain scheduling is sort of theory applied to the actual supply chain management, enterprises in order to production and processing in the supply chain and distribution arrangements. In classical scheduling problems, the processing time is often known and fixed, but in reality the production process, the processing time will appear with the delayed start time and increase the phenomenon. At the same time, in a flexible supply chain, the manufacturer does not accept all orders from customers, often according to the needs of enterprises to outsource or refuse to part of the workpiece to obtain more profits. Not only that, the manufacturer the workpiece completed timely delivery to the customer. Therefore, how manufacturers choose to accept jobs, how to arrange the production scheduling and distribution problem of workpiece receiving set, and on this basis, To minimize cost of goods, total distribution costs and outsourcing costs, is particularly important. This paper is organized as follows: the first chapter mainly introduces the basic knowledge of scheduling problem, the main concepts and basic knowledge of combinatorial optimization, and the machine has a deteriorating effect briefly, scheduling problem of outsourcing, finally a brief description of the research status the major research achievements of this paper. The second chapter mainly considers the total cost of outsourcing in the absence of restrictions, with stand-alone outsourcing supply chain scheduling with deterioration effect: manufacturers get all the necessary part of the process at time zero set, each job has the same basic processing time, but the actual processing time is simple linear increasing function of the starting time. Each job can be processed, also can choose outsourcing to third party manufacturers, contractors need to pay The cost of outsourcing. Manufacturers need to arrange vehicles on the workpiece processed in batch delivery to customers, arrange on the workpiece of the same vehicle set as a group, that group of infinite capacity, unlimited time of each job. The vehicle start is the last batch of the workpiece workpiece completion time, each job has unit time corresponding holding stock cost. This chapter studies the outsourcing cost without limitation, minimizing the holding stock cost, distribution cost and total cost of outsourcing and. The problem can be transformed into the shortest path problem in polynomial time, prove that this problem belongs to P problem; and on the basis of the above problems on the number of transport in the restricted case, the objective function is to supply chain scheduling cost and total cost of the goods and outsourcing. In the third chapter, the second chapter on the basis of considering outsourcing cost limited In the case, the objective function is the sum of the cost of holding the goods and the cost of the distribution, and the pseudo polynomial time algorithm is given based on the dynamic programming algorithm.

【学位授予单位】：曲阜师范大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：O223

【相似文献】