带有恶化效应的单机供应链排序问题

发布时间：2018-05-09 08:05

本文选题：单处理机 + 供应链排序　；参考：《曲阜师范大学》2014年硕士论文

【摘要】：排序论是运筹学中最重要的分支之一。供应链排序是供应链管理与排序理论相结合产生的新领域,它将排序理论应用于供应链管理,集成研究生产调度和分批配送这两个问题。工件带有恶化效应的排序和工件可拒绝的排序是两种新兴起的现代排序模型,它们更接近现实生活,因而具有很好的研究价值。本文将上述三类排序问题相结合,讨论了几个相关的排序问题。论文主要结构安排如下：第一章绪论部分主要介绍了供应链排序问题、带有恶化效应的排序问题、可拒绝排序,算法的复杂性以及本文所需要的基础知识,并对本文的主要工作进行了简要描述。第二章主要研究了带有恶化效应的单机供应链排序问题：一个制造商为一个客户加工工件,每个工件的加工时间是其开工时间的简单线性增函数,工件加工完之后要安排车辆配送给客户,完工时间为工件送达客户的时刻。在同一辆车配送的工件为一批,每一批可同时配送至多z n个工件,每配送一批要支付一定的配送费用。我们分析了加工时间为其开工时间的不同函数,目标函数分别为极小化总完工时间与总配送费用之和、极小化最大延误时间与总配送费用之和的情形,并分别给出了多项式时间的最优算法。第三章在第二章的基础上研究了工件可拒绝的情形。一个制造商为一个客户加工工件,每个工件既可以被接受加工,也可以被拒绝加工。若工件被拒绝,则要支付一定的拒绝费用。若工件被接受,则其加工时间是其开工时间的简单线性增函数,且加工完之后要被安排在车辆运送给客户,完工时间为工件送达客户的时间。在同一辆车配送的工件为一批,每配送一批要支付一定的配送费用,每一批可同时配送至多z n个工件。目标函数为极小化被接受工件的总完工时间、总配送费用和被拒绝工件的总拒绝费用三者之和,本文对这个问题给出了运行时间为多项式的动态规划算法。
[Abstract]:The ranking theory is one of the most important branches of operational research. The supply chain ranking is a new field of combination of supply chain management and sorting theory. It applies the ranking theory to the two problems of supply chain management, integrated research on production scheduling and batch distribution. The sorting of workpiece with deteriorating effects and the sorting of workpieces can be rejected are two emerging issues. The modern ranking model, which is closer to the real life, has a good research value. This paper combines the three sorts of sorting problems mentioned above, and discusses several related sorting problems. The main structure of the paper is as follows:
In the first chapter, the introduction part mainly introduces the problem of the ordering of supply chain, the sorting problem with the deterioration effect, the denial of sorting, the complexity of the algorithm and the basic knowledge needed in this paper, and briefly describes the main work of this paper.
The second chapter mainly deals with the problem of single machine supply chain sorting with deteriorating effect: a manufacturer processes the workpiece for one customer. The processing time of each job is a simple linear increase function of its start time. After the work is finished, the vehicle will be assigned to the customer and the job is delivered to the customer at the time of completion. Each batch can deliver up to Z n pieces at the same time, each batch can pay a certain amount of distribution cost per batch. We analyze the different functions of processing time for its start time. The objective function is to minimize the sum of total completion time and total distribution cost, minimization of the maximum delay time and total distribution cost. The optimal algorithm of polynomial time is given.
The third chapter studies the refusal of the workpiece on the basis of the second chapter. A manufacturer processes the workpiece for one customer. Each piece can be processed or refusing to process. If the workpiece is rejected, a certain denial cost is paid. If the workpiece is accepted, the processing time is a simple linear increase in the time of the work. The function, and after processing, should be arranged in the vehicle to the customer, the completion time is the time to deliver the customer. In the same car distribution of the workpiece is a batch, each batch to pay a certain distribution cost, each batch can deliver up to Z n pieces at the same time. The objective function is to minimize the total completion time of the accepted workpiece, the total allocation. The sum of the total cost of rejection and the total rejection cost of the rejected items is given. In this paper, a dynamic programming algorithm with polynomial running time is given for this problem. Three

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

【参考文献】