带有准备时间的可拒绝供应链排序  

Supply Chain Scheduling with Setup Time and Rejection

作　　者：冯艳玲[1] 张玉忠[1] 

机构地区：[1]曲阜师范大学管理学院,山东省日照市276826

出　　处：《曲阜师范大学学报（自然科学版）》2013年第3期7-11,共5页Journal of Qufu Normal University(Natural Science)

基　　金：国家自然科学基金(11071142)

摘　　要：考虑可拒绝排序中生产与配送的集成问题.有一个制造商和多个客户,不同的客户订购不同种类的工件.机器在加工不同种类的工件前要有一个准备时间.对于客户的工件制造商可以选择接受或拒绝加工,但当工件被拒绝时制造商需要支付相应的拒绝费用.每个工件有自己的工期并且生产完成后需要配送到相应的客户处,每一批配送需要花费一定的时间和费用.该文研究了排序理论中几个主要的目标函数,给出了相应的动态规划算法并分析了算法的复杂性.This paper considered multiple customers’supply chain scheduling problems with the coordination of production and distribution.There are one manufacturer and several customers.Different customers order different jobs.A setup time is incurred before the machine processes a new family of jobs.The manufacturer can accept or reject jobs,but the rejection penalty has to be paid once they reject jobs.Processed jobs are delivered in batches to their respective customers.Each job has a due date and each shipment incurs a delivery cost and a delivery time.We studied several main objective functions and gave a dynamic programming algorithm for these problems and analyzed the algorithm’s complexity.

关 键 词：供应链排序 准备时间 拒绝费用 动态规划 

分 类 号：O224[理学—运筹学与控制论]