单机带有可拒绝的供应链排序问题  

SUPPLY CHAIN SCHEDULING WITH REJECTION ON A SINGLE MACHINE

作　　者：王磊[1] 张玉忠[1] 柏庆国[1] 

机构地区：[1]曲阜师范大学管理学院

出　　处：《系统科学与数学》2014年第9期1044-1050,共7页Journal of Systems Science and Mathematical Sciences

基　　金：国家自然科学基金项目(11071142);曲阜师范大学博士科研启动基金资助课题

摘　　要：考虑了单机上带有工件拒绝的供应链排序问题.有多个客户分布在不同区域,每个客户都有一定数量的工件需要在一台机器上进行加工.制造商可以拒绝加工一些工件,但要支付相应的拒绝费用.工件生产完后需要运输到相应的客户处,每一批配送需要花费一定的时间和费用.我们研究了排序理论中主要的几个目标函数,构建了单机情况下的具体模型,分析了问题的复杂性,对具体的问题给出了它们的最优算法.In this paper,we consider the supply chain scheduling problems with rejection on a single machine.There are multiple customers located at different places.The schedulers can reject processing some jobs,but the rejection penalty has to be paid.Processed jobs are delivered in batches to their respective customers.Each job has a due date and each shipment incurs a delivery cost and takes a fixed amount of time.We consider three main objective functions in scheduling theory,construct the models in single machine environment,analyze the problem complexity and give optimal algorithms to solve the problems.

关 键 词：供应链排序 拒绝费用 分批配送 动态规划 

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