带有恶化效应的可拒绝单机供应链排序

发布时间：2018-03-19 23:09

本文选题：排序　切入点：恶化率　出处：《曲阜师范大学》2014年硕士论文　论文类型：学位论文

【摘要】：排序是组合最优化的一个重要分支，从上世纪50年代到今已经受到了许多从业人员以及理论研究者的密切关注.本文所研究的供应链排序，是在将排序理论应用到供应链管理的基础上，在工件带有恶化效应及可拒绝因素的条件下，对工件的加工和配送进行合理的排序，使得目标函数尽可能达到最优.全文共分为三章. 第一章为绪论部分，主要介绍了组合优化问题、供应链排序的产生背景及一些预备知识. 第二章考虑了加工时间带有线性恶化率的单机排序及其批配送的问题.当工件有到达时间的时候，目标函数是极小化工件的总完工时间或最大延误时间与配送费用之和；当工件有基本加工时间的时候，目标函数为极小化配送总费用与工件的加权总完工时间或者总完工时间之和.对于这些问题，我们相应的提出了基于动态规划的多项式时间算法. 第三章本章考虑了加工时间带有线性恶化率的可拒绝单机排序及其批配送的问题.如果工件被拒绝，则要付出一定的拒绝费用；如果工件被接受，则要安排加工并配送.若每个工件都在零时刻到达，工件有基本加工时间，优化目标函数为极小化配送总费用、接受工件集中工件的总完工时间或者最大延误时间以及拒绝总费用之和.对于这两个问题，我们都相应的提出了动态规划的多项式或者伪多项式时间算法.
[Abstract]:Ranking is an important branch of combinatorial optimization, which has been paid close attention by many practitioners and theoretical researchers from -50s to now. On the basis of applying ranking theory to supply chain management, the processing and distribution of jobs are sorted reasonably under the condition that the jobs have the deterioration effect and the rejection factors. Make the objective function as best as possible. The paper is divided into three chapters. The first chapter is the introduction, which mainly introduces the combinatorial optimization problem, the background of supply chain sequencing and some preparatory knowledge. In the second chapter, the problem of single machine scheduling and batch distribution with linear deterioration rate is considered. When the workpiece has arrival time, the objective function is the sum of the total completion time or the maximum delay time of the chemical parts and the delivery cost. When the workpiece has basic processing time, the objective function is to minimize the sum of the total cost of distribution and the weighted total completion time or the total completion time of the workpiece. We propose a polynomial time algorithm based on dynamic programming. In chapter 3, we consider the problem of batch distribution and rejection of processing time with linear deterioration rate. If the job is rejected, a certain amount of rejection fee will be paid; if the job is accepted, If each job arrives at zero time, the workpiece has a basic processing time, and the optimization objective function is to minimize the total cost of distribution. The total completion time or the maximum delay time and the sum of the rejection total cost of the workpiece are accepted. For these two problems, we propose a polynomial or pseudo-polynomial time algorithm for dynamic programming.
【学位授予单位】：曲阜师范大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：O223

【共引文献】