导　　师： 王国庆

学科专业： 120202

授予学位： 博士

作　　者： ;

机构地区： 暨南大学

摘　　要： 排序问题也称调度问题,是在一定的生产加工约束条件下,合理地安排工件在机器上的加工顺序,从而使某一个或多个目标达到最优。供应链管理就是对整个供应链系统进行计划、协调、操作、控制和优化的各种活动和过程。产品的生产和配送是供应链运营中的两个关键职能,本文从具体的排序角度来综合研究产品的生产和配送问题,目标是在考虑相关的效益、费用和顾客满意度的基础上,找到关于生产与配送产品的最优排序。本文主要内容总结如下： 首先研究了有多种工件族的供应链排序问题。有多个客户订购不同种类的工件,工件生产完后需要运输到客户。由于工件属于不同的种类,在加工不同种类工件前要有一个准备时间。每个客户分布在不同位置,工件是采用直接运输方式分批配送的,每一批的配送需要花费一定的时间和费用。本文研究了四个目标函数,第一个是极小化加权工件最大完工时间与配送费用之和；第二个是极小化加权总完工时间与配送费用之和；第三个是极小化加权工件最大延迟与配送费用之和；第四个是极小化加权总误工工件个数与配送费用之和。本文分析了问题的性质,给出了这些问题的最优算法,并且给出了具体算例来说明算法的实行过程。 其次研究了带强制交货期的供应链排序问题。有多个客户分布在不同位置,每个客户都有多个订单交给制造商加工,每个订单都有一个强制交货期。目标函数是在满足订单强制交货期的情况下,找到订单加工和配送的最优排序,以极小化总的配送费用。本文分别考虑了订单强制交货期的不同情况,分别给出了问题相应的算法。 接着研究了有多种运输方式的供应链排序问题。每个客户有一个订单交给制造商加工,每个订单都有一个强制交货期。工厂采用承诺到货时间的发货方式,配送费用与产品的数量以及距离强制交货期的时间有关。目标是在满足客户强制交货期的前提下,合理的安排订单的加工顺序,以极小化总的配送费用。本文对于订单是否允许部分配送,客户是否订购每种产品以及需求量与产量的关系的不同情况,研究了多个问题,分别给出了问题相应的算法。 最后研究了订单的交货期可以指派的供应链排序问题。每个客户有多个订单交给制造商加工,每个客户有一个可以接受的完工订单到达时间。制造商可以与客户进行协商来选定合适的交货期。目标是对每个订单指派合适的交货期,并且进行生产和配送的排序,以极小化总的费用。本文研究了两个目标函数,第一个是极小化总的交货期指派费用,订单误工数惩罚费用与配送费用的和。第二个是极小化总的交货期指派费用,订单延误时间惩罚费用与配送费用的和。对于每个客户包含的订单数量,本文考虑了多种情况,分别给出了相应的算法。 Scheduling problems consist in deciding the appropriate processing sequence on the machines under certain production constraints, in order to optimize one or more given objectives. Supply chain management is the plan,coordination and optimization of the whole supply chain system. Production and delivery operations are the two key operational functions in a supply chain. This thesis mainly concerns some scheduling problems in supply chain management. The objective is to find the optimal production and delivery scheduling when considering both the cost and customer satisfaction. The main contribution of this thesis can be summarized as follows: First this thesis study the supply chain scheduling problems with multiple job families. The jobs belong to different families and they need to be delivered to multiple customers after processing. A setup time is incurred for a job if it is the first job to be processed on a machine or its processing on a machine follows a job that belongs to another family. Processed jobs are delivered in batches to their respective customers, each shipment incurs a delivery cost and takes a fixed amount of time. We study four different objectives. The first is to minimize the weighted maximum completion time of jobs and delivery costs. The second is to minimize the weighted total completion time of jobs and delivery costs. The third is to minimize the weighted maximum lateness of jobs and delivery costs. The last is to minimize the weighted total number of late jobs and delivery costs. Optimal algorithms are proposed to solve the problems, and a numerical example is given to demonstrate the implementation of the algorithms. Secondly this thesis study the supply chain scheduling with deadlines. A set of orders with deadlines needs to be processed by the manufacturer and delivered to the customers upon completion. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the manufacturer and order delivery from the manufacturer to the customers that minimize the total distribution cost with deadline constraint. We study the solvability of multiple cases of the problem by providing efficient algorithms. Thirdly this thesis study the supply chain scheduling with multiple transportation modes. A set of orders with deadlines needs to be processed by the manufacturer and delivered to the customers upon completion. The manufacturer adopts a commit-to-delivery business mode. The problem is to find a joint schedule of order processing at the manufacturer and order delivery from the manufacturer to the customers that minimize the total distribution cost with deadline constraint. We study the solvability of multiple cases of the problem by providing efficient algorithms. Finally this thesis study the supply chain scheduling with due date assignment. A set of orders needs to be processed by the manufacturer and delivered to the customers upon completion. Each customer has a specific acceptable lead time. The manufacturer assigns a due date for one order by negotiating with the customers. The problem is to assign appropriate due date for the orders, and find a joint schedule of order processing at the manufacturer and order delivery from the manufacturer to the customers that minimize the total cost. We study two different objectives. The first is to minimize the total number of late order penalty, due date assignment and delivery costs. The second is to minimize the total tardiness penalty, due date assignment and delivery costs. We study the solvability of multiple cases of the problem by providing efficient algorithms.

关 键 词： 排序 供应链管理 交货期 分批配送 动态规划

分 类 号： [F274 F224]

领　　域： [经济管理] [经济管理] [经济管理]